Filtrer vos résultats
- 213
- 13
- 100
- 39
- 36
- 36
- 9
- 3
- 1
- 1
- 1
- 25
- 3
- 3
- 219
- 27
- 1
- 1
- 1
- 788
- 659
- 609
- 589
- 532
- 478
- 431
- 391
- 369
- 324
- 321
- 317
- 312
- 307
- 305
- 294
- 290
- 283
- 266
- 259
- 251
- 226
- 220
- 218
- 218
- 218
- 216
- 215
- 213
- 212
- 211
- 205
- 202
- 201
- 200
- 197
- 196
- 194
- 192
- 191
- 191
- 189
- 183
- 182
- 179
- 179
- 178
- 176
- 174
- 171
- 170
- 167
- 164
- 162
- 161
- 161
- 159
- 157
- 157
- 156
- 155
- 154
- 154
- 152
- 152
- 152
- 150
- 150
- 149
- 148
- 147
- 147
- 144
- 142
- 142
- 141
- 141
- 141
- 140
- 139
- 139
- 139
- 138
- 137
- 137
- 136
- 136
- 136
- 136
- 136
- 135
- 135
- 133
- 132
- 131
- 131
- 131
- 131
- 131
- 128
- 4
- 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
- 200
- 26
- 54
- 43
- 39
- 30
- 30
- 23
- 21
- 21
- 19
- 18
- 16
- 14
- 12
- 12
- 9
- 8
- 8
- 7
- 7
- 6
- 6
- 6
- 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
- 1
- 16
- 13
- 10
- 9
- 8
- 8
- 8
- 8
- 6
- 6
- 6
- 6
- 6
- 6
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 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
|
Efficient Extensional Binary TriesJournal of Automated Reasoning, 2023, 67, pp.Article number 8. ⟨10.1007/s10817-022-09655-x⟩
Article dans une revue
hal-03372247v4
|
||
|
Coqcots & Pycots: non-stopping components for safe dynamic reconfigurationCBSE 2014 : proceedings of the 17th international ACM Sigsoft symposium on Component-based software engineering, Jun 2014, Lille, France. pp.1, ⟨10.1145/2602458.2602459⟩
Communication dans un congrès
hal-00984365v1
|
||
|
A Coq Formalization of Lebesgue Integration of Nonnegative Functions[Research Report] RR-9401, Inria, France. 2021, pp.38
Rapport
hal-03194113v2
|
||
|
Hilbert's Tenth Problem in Coq (Extended Version)Logical Methods in Computer Science, 2022, 18 (1), ⟨10.46298/lmcs-18(1:35)2022⟩
Article dans une revue
hal-03359505v2
|
||
|
A Formal Proof in Coq of a Control Function for the Inverted PendulumCPP 2018 - 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, Jan 2018, Los Angeles, United States. pp.1-14, ⟨10.1145/3167101⟩
Communication dans un congrès
hal-01639819v2
|
||
|
Définition de la classe de réécriture à intégrer[Contrat] A04-R-487 || blanqui04c, 2004, 7 p
Rapport
inria-00099930v1
|
||
|
A Taylor Function Calculus for Hybrid System Analysis: Validation in CoqNSV-3: Third International Workshop on Numerical Software Verification., Fainekos, Georgios and Goubault, Eric and Putot, Sylvie, Jul 2010, Edinburgh, United Kingdom
Communication dans un congrès
inria-00473270v1
|
||
|
Formal Proofs of Rounding Error BoundsJournal of Automated Reasoning, 2015, pp.23. ⟨10.1007/s10817-015-9339-z⟩
Article dans une revue
hal-01091189v2
|
||
|
System-level Non-interference for Constant-time CryptographyACM SIGSAC Conference on Computer and Communications Security, CCS'14, Nov 2014, Scottsdale, United States. pp.1267 - 1279, ⟨10.1145/2660267.2660283⟩
Communication dans un congrès
hal-01101950v1
|
||
|
Elpi: an extension language for Coq (Metaprogramming Coq in the Elpi λProlog dialect)The Fourth International Workshop on Coq for Programming Languages, Jan 2018, Los Angeles (CA), United States
Communication dans un congrès
hal-01637063v1
|
||
|
Towards Verifying Declarative Netlog Protocols with Coq[Intern report] 2010, pp.20
Rapport
inria-00506093v1
|
||
|
Vérification formelle d'extractions de racines entièresRevue des Sciences et Technologies de l'Information - Série TSI : Technique et Science Informatiques, 2005, Langages Applicatifs, Spécifications, Programmation, Vérification, 24 (9), pp.1161-1195
Article dans une revue
inria-00001172v1
|
||
|
Short proof of Menger's Theorem in Coq (Proof Pearl)2019
Pré-publication, Document de travail
hal-02086931v1
|
||
|
On the Use of Formal Methods to Model and Verify Neuronal ArchetypesFrontiers of Computer Science, 2021, 16, pp.28
Article dans une revue
hal-03053930v1
|
||
|
The Last Yard: Foundational End-to-End Verification of High-Speed CryptographyCPP 2024 - 13th ACM SIGPLAN International Conference on Certified Programs and Proofs, Jan 2024, London, United Kingdom. pp.30-44, ⟨10.1145/3636501.3636961⟩
Communication dans un congrès
hal-04484598v1
|
||
|
Managing Logical and Computational Complexity using Program TransformationsCategory Theory [math.CT]. université de nantes, 2016
HDR
tel-01406351v1
|
||
|
A new Type-Class solver for Coq in ElpiThe Coq Workshop 2023, Jul 2023, Białystok, Poland
Communication dans un congrès
hal-04467855v1
|
||
|
Accurate calculation of Euclidean Norms using Double-word arithmeticACM Transactions on Mathematical Software, 2023, 49 (1), pp.1-34. ⟨10.1145/3568672⟩
Article dans une revue
hal-03482567v2
|
||
|
Unsolvability of the Quintic Formalized in Dependent Type TheoryITP 2021 - 12th International Conference on Interactive Theorem Proving, Jun 2021, Rome / Virtual, France
Communication dans un congrès
hal-03136002v4
|
||
|
Lawvere-Tierney sheafification in Homotopy Type TheoryLogic in Computer Science [cs.LO]. Ecole des Mines de Nantes, 2016. English. ⟨NNT : 2016EMNA0298⟩
Thèse
tel-01486550v1
|
||
|
Compilation of Linearizable Data Structures[Research Report] ENS Rennes; IRISA, Inria Rennes; Université Rennes 1. 2017
Rapport
hal-01538128v1
|
||
|
Reliably Reproducing Machine-Checked Proofs with the Coq PlatformRRRR 2022 - Workshop on Reproducibility and Replication of Research Results, Apr 2022, Munich, Germany
Communication dans un congrès
hal-03592675v2
|
||
|
Verification of a Concurrent Garbage CollectorData Structures and Algorithms [cs.DS]. École normale supérieure de Rennes, 2017. English. ⟨NNT : 2017ENSR0010⟩
Thèse
tel-01680213v2
|
||
|
CoqTL: an Internal DSL for Model Transformation in CoqICMT 2018 - 11th International Conference on Theory and Practice of Model Transformations, Jun 2018, Toulouse, France. pp.142-156, ⟨10.1007/978-3-319-93317-7_7⟩
Communication dans un congrès
hal-01828344v1
|
||
|
Construction of real algebraic numbers in CoqITP - 3rd International Conference on Interactive Theorem Proving - 2012, Aug 2012, Princeton, United States
Communication dans un congrès
hal-00671809v2
|
||
|
Développement modulaire de théories et gestion de l'espace de nom pour l'assistant de preuve Coq.Langage de programmation [cs.PL]. Ecole Polytechnique X, 2010. Français. ⟨NNT : ⟩
Thèse
tel-00679201v1
|
||
|
Generation of Inductive Types from Ecore MetamodelsModel-Driven Engineering and Software Development. MODELSWARD 2018., pp.308-334, 2019
Chapitre d'ouvrage
hal-02021361v1
|
||
|
Formal Proof of Soundness for an RL Prover[Technical Report] RR-0471, INRIA Lille - Nord Europe; Alexandru Ioan Cuza, University of Iasi. 2015, pp.27
Rapport
hal-01244578v1
|
||
|
Consistency of the Predicative Calculus of Cumulative Inductive Constructions (pCuIC)[Research Report] RR-9105, KU Leuven, Belgium; Inria Paris. 2017, pp.32
Rapport
hal-01615123v3
|
||
|
Deciding Kleene Algebras in CoqITP, Aug 2010, Edinburgh, United Kingdom. pp.163-178, ⟨10.1007/978-3-642-14052-5_13⟩
Communication dans un congrès
hal-00383070v5
|