Filtrer vos résultats
- 212
- 13
- 100
- 39
- 36
- 35
- 9
- 3
- 1
- 1
- 1
- 25
- 3
- 3
- 218
- 27
- 1
- 1
- 786
- 659
- 608
- 589
- 533
- 478
- 431
- 390
- 368
- 323
- 320
- 317
- 312
- 307
- 304
- 294
- 290
- 283
- 266
- 259
- 250
- 225
- 219
- 218
- 218
- 218
- 215
- 215
- 213
- 211
- 209
- 205
- 201
- 200
- 198
- 197
- 195
- 193
- 192
- 191
- 191
- 189
- 183
- 181
- 179
- 179
- 178
- 176
- 174
- 171
- 170
- 167
- 164
- 162
- 161
- 161
- 159
- 157
- 157
- 156
- 155
- 154
- 153
- 153
- 152
- 151
- 150
- 150
- 149
- 148
- 147
- 147
- 144
- 142
- 142
- 141
- 141
- 140
- 140
- 140
- 139
- 138
- 137
- 137
- 137
- 136
- 136
- 136
- 136
- 136
- 135
- 135
- 133
- 132
- 131
- 131
- 131
- 131
- 131
- 128
- 3
- 21
- 12
- 15
- 10
- 13
- 19
- 17
- 13
- 7
- 8
- 16
- 9
- 10
- 12
- 6
- 4
- 5
- 5
- 4
- 6
- 1
- 4
- 1
- 2
- 1
- 1
- 199
- 26
- 54
- 42
- 39
- 30
- 29
- 23
- 21
- 21
- 19
- 18
- 16
- 13
- 12
- 12
- 9
- 8
- 8
- 7
- 6
- 6
- 6
- 5
- 5
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 15
- 13
- 10
- 9
- 8
- 8
- 8
- 7
- 6
- 6
- 6
- 6
- 6
- 6
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
|
A PCC Architecture based on Certified Abstract Interpretation[Research Report] PI 1764, 2005, pp.35
Rapport
inria-00000866v1
|
||
Certification of Termination Proofs Using Polynomial Interpretations17th European Summer School in Logic, Language and Information - ESSLLI '05, Aug 2005, Edimbourg/Grande Bretagne
Communication dans un congrès
inria-00001205v1
|
|||
|
Some Formal Tools for Computer Arithmetic: Flocq and GappaARITH 2021 - 28th IEEE International Symposium on Computer Arithmetic, Jun 2021, Online, Italy
Communication dans un congrès
hal-03233227v1
|
||
|
Bibliothèque certifiée en Coq pour la provenance des donnéesLogique en informatique [cs.LO]. Université Paris-Saclay, 2023. Français. ⟨NNT : 2023UPASG040⟩
Thèse
tel-04165484v1
|
||
|
Safe reconfiguration of Coqcots and Pycots componentsJournal of Systems and Software, 2016, 122, pp.430-444. ⟨10.1016/j.jss.2015.11.039⟩
Article dans une revue
hal-01235602v1
|
||
|
A simple test qualifying the accuracy of Horner's rule for polynomials[Research Report] LIP RR-2003-01, Laboratoire de l'informatique du parallélisme. 2003, 2+39p
Rapport
hal-02102015v1
|
||
|
Formal Foundations of 3D Geometry to Model Robot ManipulatorsConference on Certified Programs and Proofs 2017, Jan 2017, Paris, France
Communication dans un congrès
hal-01414753v1
|
||
|
Measure Construction by Extension in Dependent Type Theory with Application to IntegrationJournal of Automated Reasoning, 2023, 67 (3), pp.28. ⟨10.1007/s10817-023-09671-5⟩
Article dans une revue
hal-04183173v1
|
||
|
Views of Pi: definition and computationJournal of Formalized Reasoning, 2014, 7 (1), pp.105-129. ⟨10.6092/issn.1972-5787/4343⟩
Article dans une revue
hal-01074926v1
|
||
|
Kleene Algebra with Tests and Coq Tools for While ProgramsInteractive Theorem Proving 2013, Jul 2013, Rennes, France. pp.180-196, ⟨10.1007/978-3-642-39634-2_15⟩
Communication dans un congrès
hal-00785969v1
|
||
|
HOCore in CoqInteractive Theorem Proving, Aug 2015, Nanjing, China. ⟨10.1007/978-3-319-22102-1_19⟩
Communication dans un congrès
hal-01243017v1
|
||
|
Micro-Policies: Formally Verified, Tag-Based Security Monitors2015 IEEE Symposium on Security and Privacy, May 2015, San Jose, United States. pp.813 - 830, ⟨10.1109/SP.2015.55⟩
Communication dans un congrès
hal-01265666v1
|
||
|
Proof reconstruction (preliminary version).[Research Report] LIP 1996-26, Laboratoire de l'informatique du parallélisme. 1996, 2+14p
Rapport
hal-02101787v1
|
||
|
Verified programming and secure integration of operating system libraries in CoqSystems and Control [cs.SY]. Université de Rennes, 2023. English. ⟨NNT : 2023URENS060⟩
Thèse
tel-04405955v1
|
||
|
Semantics of Probabilistic Programs using s-Finite Kernels in CoqCPP 2023 - Certified Programs and Proofs, Jan 2023, Boston, United States. ⟨10.1145/3573105.3575691⟩
Communication dans un congrès
hal-03917948v1
|
||
|
A formal exploration of Nominal Kleene AlgebraMFCS, Aug 2016, Cracovie, Poland. ⟨10.4230/LIPIcs.MFCS.2016.22⟩
Communication dans un congrès
hal-01307532v2
|
||
|
Automatic Transformation from Ecore Metamodels towards Gallina Inductive TypesMODELSWARD 2018, Jan 2018, Santa Cruz, Portugal. ⟨10.5220/0006608604880495⟩
Communication dans un congrès
hal-01693939v1
|
||
|
A Formal Correctness Proof for an EDF Scheduler ImplementationRTAS 2022: 28th IEEE Real-Time and Embedded Technology and Applications Symposium, May 2022, Milan, Italy. ⟨10.1109/RTAS54340.2022.00030⟩
Communication dans un congrès
hal-03671598v2
|
||
|
Challenges in the collaborative development of a complex mathematical software and its ecosystemOpenSym 2018 - 14th International Symposium on Open Collaboration, Aug 2018, Paris, France. ⟨10.1145/3233391.3233966⟩
Communication dans un congrès
hal-01951322v1
|
||
|
Certification of an Instruction Set SimulatorSystèmes embarqués. Université de Grenoble, 2013. Français. ⟨NNT : ⟩
Thèse
tel-00937524v1
|
||
|
CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificatesMathematical Structures in Computer Science, 2011, 21 (4), pp.827-859. ⟨10.1017/S0960129511000120⟩
Article dans une revue
inria-00543157v1
|
||
|
Prototype d'extension du système Coq[Contrat] A04-R-505 || blanqui04e, 2004, 8 p
Rapport
inria-00099932v1
|
||
|
A formal quantifier elimination for algebraically closed fieldsSymposium on the Integration of Symbolic Computation and Mechanised Reasoning, Calculemus, Jul 2010, Paris, France. pp.189-203, ⟨10.1007/978-3-642-14128-7_17⟩
Communication dans un congrès
inria-00464237v3
|
||
|
CoLoR: a Coq library on rewriting and terminationEighth International Workshop on Termination - WST 2006, Aug 2006, Seattle, United States
Communication dans un congrès
inria-00084835v2
|
||
|
Formal proofs in real algebraic geometry: from ordered fields to quantifier eliminationLogical Methods in Computer Science, 2012, 8 (1:02), pp.1-40. ⟨10.2168/LMCS-8(1:02)2012⟩
Article dans une revue
inria-00593738v4
|
||
|
Formalization and closedness of finite dimensional subspacesSYNASC 2017 - 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Sep 2017, Timișoara, Romania. pp.1-7
Communication dans un congrès
hal-01630411v1
|
||
|
Towards an Independent Version of Tarski's System of Geometry14th International Conference on Automated Deduction in Geometry, Sep 2023, Belgrade, Serbia. pp.73-84, ⟨10.4204/EPTCS.398.11⟩
Communication dans un congrès
hal-04324071v1
|
||
|
A Coq Formalization of the Bochner integral[Research Report] RR-9456, Inria Saclay - Île de France; Inria de Paris. 2022
Rapport
hal-03516749v2
|
||
|
Synthetic Undecidability of MSELL via FRACTRAN Mechanised in Coq6th International Conference on Formal Structures for Computation and Deduction (FSCD 2021), Jul 2021, Buenos Aires, Argentina. ⟨10.4230/LIPIcs.FSCD.2021.18⟩
Communication dans un congrès
hal-03280264v1
|
||
|
Proof Pearl: Faithful Computation and Extraction of µ-Recursive Algorithms in Coq14th International Conference on Interactive Theorem Proving (ITP 2023), Adam Naumowicz; René Thiemann, Jul 2023, Białystok, Poland. pp.21:1--17, ⟨10.4230/LIPIcs.ITP.2023.21⟩
Communication dans un congrès
hal-04200527v1
|