Team, Visitors, External Collaborators
Overall Objectives
Research Program
Application Domains
Highlights of the Year
New Software and Platforms
New Results
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
Dissemination
Bibliography
XML PDF e-pub
PDF e-Pub


Bibliography

Major publications by the team in recent years
[1]
F. Bobot, S. Conchon, É. Contejean, M. Iguernelala, A. Mahboubi, A. Mebsout, G. Melquiond.
A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic, in: IJCAR 2012: Proceedings of the 6th International Joint Conference on Automated Reasoning, Manchester, UK, B. Gramlich, D. Miller, U. Sattler (editors), Lecture Notes in Computer Science, Springer, June 2012, vol. 7364, pp. 67–81.
http://hal.inria.fr/hal-00687640
[2]
F. Bobot, J.-C. Filliâtre, C. Marché, A. Paskevich.
Let's Verify This with Why3, in: International Journal on Software Tools for Technology Transfer (STTT), 2015, vol. 17, no 6, pp. 709–727.
http://hal.inria.fr/hal-00967132/en
[3]
S. Boldo, F. Clément, J.-C. Filliâtre, M. Mayero, G. Melquiond, P. Weis.
Wave Equation Numerical Resolution: a Comprehensive Mechanized Proof of a C Program, in: Journal of Automated Reasoning, April 2013, vol. 50, no 4, pp. 423–456.
http://hal.inria.fr/hal-00649240/en/
[4]
S. Boldo, G. Melquiond.
Computer Arithmetic and Formal Proofs: Verifying Floating-point Algorithms with the Coq System, ISTE Press - Elsevier, December 2017.
https://hal.inria.fr/hal-01632617
[5]
S. Conchon, A. Goel, S. Krstić, A. Mebsout, F. Zaïdi.
Cubicle: A Parallel SMT-based Model Checker for Parameterized Systems, in: CAV 2012: Proceedings of the 24th International Conference on Computer Aided Verification, Berkeley, California, USA, M. Parthasarathy, S. A. Seshia (editors), Lecture Notes in Computer Science, Springer, July 2012, vol. 7358.
http://hal.archives-ouvertes.fr/hal-00799272
[6]
S. Conchon, M. Iguernelala, K. Ji, G. Melquiond, C. Fumex.
A Three-tier Strategy for Reasoning about Floating-Point Numbers in SMT, in: Computer Aided Verification, 2017.
https://hal.inria.fr/hal-01522770
[7]
J.-C. Filliâtre, L. Gondelman, A. Paskevich.
The Spirit of Ghost Code, in: Formal Methods in System Design, 2016, vol. 48, no 3, pp. 152–174.
https://hal.archives-ouvertes.fr/hal-01396864v1
[8]
C. Fumex, C. Dross, J. Gerlach, C. Marché.
Specification and Proof of High-Level Functional Properties of Bit-Level Programs, in: 8th NASA Formal Methods Symposium, Minneapolis, MN, USA, S. Rayadurgam, O. Tkachuk (editors), Lecture Notes in Computer Science, Springer, June 2016, vol. 9690, pp. 291–306.
https://hal.inria.fr/hal-01314876
[9]
C. Marché.
Verification of the Functional Behavior of a Floating-Point Program: an Industrial Case Study, in: Science of Computer Programming, March 2014, vol. 96, no 3, pp. 279–296.
http://hal.inria.fr/hal-00967124/en
[10]
É. Martin-Dorel, G. Melquiond.
Proving Tight Bounds on Univariate Expressions with Elementary Functions in Coq, in: Journal of Automated Reasoning, 2016.
https://hal.inria.fr/hal-01086460
Publications of the year

Doctoral Dissertations and Habilitation Theses

[11]
M. Clochard.
Methods and tools for specification and proof of difficult properties of sequential programs, Université Paris-Saclay, March 2018.
https://tel.archives-ouvertes.fr/tel-01787689
[12]
D. Declerck.
Verification via Model Checking of Parameterized Concurrent Programs on Weak Memory Models, Université Paris-Saclay, September 2018.
https://tel.archives-ouvertes.fr/tel-01900842

Articles in International Peer-Reviewed Journals

[13]
M. Clochard, L. Gondelman, M. Pereira.
The Matrix Reproved: Verification Pearl, in: Journal of Automated Reasoning, 2018, vol. 60, no 3, pp. 365-383. [ DOI : 10.1007/s10817-017-9436-2 ]
https://hal.inria.fr/hal-01617437
[14]
S. Dailler, D. Hauzar, C. Marché, Y. Moy.
Instrumenting a Weakest Precondition Calculus for Counterexample Generation, in: Journal of Logical and Algebraic Methods in Programming, 2018, vol. 99, pp. 97–113.
https://hal.inria.fr/hal-01802488
[15]
A. Mahboubi, G. Melquiond, T. Sibut-Pinote.
Formally Verified Approximations of Definite Integrals, in: Journal of Automated Reasoning, March 2018, pp. 1-20. [ DOI : 10.1007/s10817-018-9463-7 ]
https://hal.inria.fr/hal-01630143
[16]
A. Volkova, M. Istoan, F. de Dinechin, T. Hilaire.
Towards Hardware IIR Filters Computing Just Right: Direct Form I Case Study, in: IEEE Transactions on Computers, 2018. [ DOI : 10.1109/TC.2018.2879432 ]
https://hal.sorbonne-universite.fr/hal-01561052

International Conferences with Proceedings

[17]
S. Boldo, F. Faissole, V. Tourneur.
A Formally-Proved Algorithm to Compute the Correct Average of Decimal Floating-Point Numbers, in: 25th IEEE Symposium on Computer Arithmetic, Amherst, MA, United States, June 2018.
https://hal.inria.fr/hal-01772272
[18]
S. Dailler, C. Marché, Y. Moy.
Lightweight Interactive Proving inside an Automatic Program Verifier, in: 4th Workshop on Formal Integrated Development Environment, Oxford, United Kingdom, P. Masci, R. Monahan, V. Prevosto (editors), Electronic Proceedings in Theoretical Computer Science, Open Publishing Association, 2018, vol. 284.
https://hal.inria.fr/hal-01936302
[19]
D. Gallois-Wong, S. Boldo, T. Hilaire.
A Coq formalization of digital filters, in: CICM 2018 - 11th Conference on Intelligent Computer Mathematics, Hagenberg, Austria, F. Rabe, W. M. Farmer, G. O. Passmore, A. Youssef (editors), Intelligent Computer Mathematics, August 2018, pp. 87–103. [ DOI : 10.1007/978-3-319-96812-4_8 ]
https://hal.inria.fr/hal-01728828
[20]
G. Melquiond, R. Rieu-Helft.
A Why3 Framework for Reflection Proofs and its Application to GMP's Algorithms, in: 9th International Joint Conference on Automated Reasoning, Oxford, United Kingdom, D. Galmiche, S. Schulz, R. Sebastiani (editors), Lecture Notes in Computer Science, July 2018, no 10900, pp. 178-193. [ DOI : 10.1007/978-3-319-94205-6_13 ]
https://hal.inria.fr/hal-01699754
[21]
P. Roux, M. Iguernelala, S. Conchon.
A Non-linear Arithmetic Procedure for Control-Command Software Verification, in: 24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Thessalonique, Greece, Lecture Notes in Computer Science, Springer, April 2018, vol. 10806, pp. 132-151.
https://hal.archives-ouvertes.fr/hal-01737737

National Conferences with Proceedings

[22]
F. Faissole.
Définir le fini : deux formalisations d'espaces de dimension finie, in: JLFA 2018 - Journées Francophones des Langages Applicatifs, Banyuls-sur-mer, France, 29èmes Journées Francophones des Langages Applicatifs, January 2018, pp. 1-6.
https://hal.inria.fr/hal-01654457
[23]
F. Faissole, B. Spitters.
Preuves constructives de programmes probabilistes, in: JFLA 2018 - Journées Francophones des Langages Applicatifs, Banyuls-sur-Mer, France, 29èmes Journées Francophones des Langages Applicatifs, January 2018.
https://hal.inria.fr/hal-01654459
[24]
J.-C. Filliâtre, M. Pereira, S. Melo De Sousa.
Vérification de programmes OCaml fortement impératifs avec Why3, in: JFLA 2018 - Journées Francophones des Langages Applicatifs, Banyuls-sur-Mer, France, January 2018, pp. 1-14.
https://hal.inria.fr/hal-01649989
[25]
D. Gallois-Wong.
Formalisation en Coq d'algorithmes de filtres numériques, in: Journées Francophones des Langages Applicatifs (JFLA) 2019, Les Rousses, France, Journées Francophones des Langages Applicatifs 2019, Nicolas Magaud, January 2019.
https://hal.inria.fr/hal-01929531
[26]
R. Rieu-Helft.
Un mécanisme d'extraction vers C pour Why3, in: 29èmes Journées Francophones des Langages Applicatifs, Banyuls-sur-Mer, France, January 2018.
https://hal.inria.fr/hal-01653153
[27]
R. Rieu-Helft.
Un mécanisme de preuve par réflexion pour Why3 et son application aux algorithmes de GMP, in: 30èmes Journées Francophones des Langages Applicatifs, Rousses, France, January 2019.
https://hal.inria.fr/hal-01943010

Scientific Books (or Scientific Book chapters)

[28]
J.-M. Muller, N. Brunie, F. de Dinechin, C.-P. Jeannerod, M. Joldes, V. Lefèvre, G. Melquiond, N. Revol, S. Torres.
Handbook of Floating-point Arithmetic (2nd edition), Birkhäuser Basel, July 2018, pp. 1-627. [ DOI : 10.1007/978-3-319-76526-6 ]
https://hal.inria.fr/hal-01766584

Internal Reports

[29]
M. Clochard, A. Paskevich, C. Marché.
Deductive Verification via Ghost Debugging, Inria Saclay Ile de France, October 2018, no RR-9219.
https://hal.inria.fr/hal-01907894
[30]
Q. Garchery.
Démonstration automatique en Coq, Paris Diderot ; Laboratoire de recherche en informatique (LRI) UMR CNRS 8623, Université Paris-Sud, August 2018.
https://hal.archives-ouvertes.fr/hal-01874777

Other Publications

[31]
S. Boldo, F. Faissole, A. Chapoutot.
Round-off error and exceptional behavior analysis of explicit Runge-Kutta methods, September 2018, working paper or preprint.
https://hal.archives-ouvertes.fr/hal-01883843
[32]
M. Clochard, C. Marché, A. Paskevich.
Deductive Verification with Ghost Monitors, November 2018, working paper or preprint.
https://hal.inria.fr/hal-01926659
[33]
J.-C. Filliâtre, L. Gondelman, A. Paskevich, M. Pereira, S. Melo De Sousa.
A Toolchain to Produce Correct-by-Construction OCaml Programs, May 2018, working paper or preprint.
https://hal.inria.fr/hal-01783851
[34]
D. Gallois-Wong, S. Boldo, P. Cuoq.
Optimal Inverse Projection of Floating-Point Addition, November 2018, working paper or preprint.
https://hal.inria.fr/hal-01939097
[35]
G.-A. Jaloyan, C. Dross, M. Maalej, Y. Moy, A. Paskevich.
Verification of Programs with Pointers in SPARK, November 2018, working paper or preprint.
https://hal.inria.fr/hal-01936105
[36]
A. Volkova, T. Hilaire, C. Lauter.
Arithmetic approaches for rigorous design of reliable Fixed-Point LTI filters, November 2018, working paper or preprint.
https://hal.archives-ouvertes.fr/hal-01918650
References in notes
[37]
B. Beckert, R. Hähnle, P. H. Schmitt (editors)
Verification of Object-Oriented Software: The KeY Approach, Lecture Notes in Computer Science, Springer, 2007, vol. 4334.
[38]
U. A. Acar, A. Charguéraud, M. Rainey.
Theory and Practice of Chunked Sequences, in: European Symposium on Algorithms, Wroclaw, Poland, A. Schulz, D. Wagner (editors), Lecture Notes in Computer Science, Springer, September 2014, vol. 8737, pp. 25–36.
https://hal.inria.fr/hal-01087245
[39]
U. A. Acar, A. Charguéraud, M. Rainey.
Oracle-Guided Scheduling for Controlling Granularity in Implicitly Parallel Languages, in: Journal of Functional Programming, November 2016, vol. 26.
https://hal.inria.fr/hal-01409069
[40]
U. A. Acar, A. Charguéraud, M. Rainey, F. Sieczkowski.
Dag-calculus: a calculus for parallel computation, in: Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming (ICFP), Nara, Japan, September 2016, pp. 18–32.
https://hal.inria.fr/hal-01409022
[41]
J. B. Almeida, M. Barbosa, J.-C. Filliâtre, J. S. Pinto, B. Vieira.
CAOVerif: An Open-Source Deductive Verification Platform for Cryptographic Software Implementations, in: Science of Computer Programming, October 2012.
[42]
A. Ayad, C. Marché.
Multi-Prover Verification of Floating-Point Programs, in: Fifth International Joint Conference on Automated Reasoning, Edinburgh, Scotland, J. Giesl, R. Hähnle (editors), Lecture Notes in Artificial Intelligence, Springer, July 2010, vol. 6173, pp. 127–141.
http://hal.inria.fr/inria-00534333
[43]
D. Baelde, P. Courtieu, D. Gross-Amblard, C. Paulin-Mohring.
Towards Provably Robust Watermarking, in: ITP 2012, Lecture Notes in Computer Science, August 2012, vol. 7406.
http://hal.inria.fr/hal-00682398
[44]
C. Barrett, C. Tinelli.
CVC3, in: 19th International Conference on Computer Aided Verification, Berlin, Germany, W. Damm, H. Hermanns (editors), Lecture Notes in Computer Science, Springer, July 2007, vol. 4590, pp. 298–302.
[45]
P. Baudin, J.-C. Filliâtre, C. Marché, B. Monate, Y. Moy, V. Prevosto.
ACSL: ANSI/ISO C Specification Language, version 1.4, 2009.
[46]
P. Behm, P. Benoit, A. Faivre, J.-M. Meynadier.
METEOR : A successful application of B in a large project, in: Proceedings of FM'99: World Congress on Formal Methods, J. M. Wing, J. Woodcock, J. Davies (editors), Lecture Notes in Computer Science (Springer-Verlag), Springer Verlag, September 1999, pp. 369–387.
[47]
J. C. Blanchette, A. Paskevich.
TFF1: The TPTP typed first-order form with rank-1 polymorphism, in: 24th International Conference on Automated Deduction (CADE-24), Lake Placid, USA, Lecture Notes in Artificial Intelligence, Springer, June 2013, vol. 7898.
http://hal.inria.fr/hal-00825086
[48]
F. Bobot, S. Conchon, É. Contejean, M. Iguernelala, S. Lescuyer, A. Mebsout.
The Alt-Ergo Automated Theorem Prover, 2008.
[49]
F. Bobot, J.-C. Filliâtre.
Separation Predicates: a Taste of Separation Logic in First-Order Logic, in: 14th International Conference on Formal Ingineering Methods (ICFEM), Kyoto, Japan, Lecture Notes in Computer Science, Springer, November 2012, vol. 7635.
http://hal.inria.fr/hal-00825088
[50]
F. Bobot, J.-C. Filliâtre, C. Marché, G. Melquiond, A. Paskevich.
Preserving User Proofs Across Specification Changes, in: Verified Software: Theories, Tools, Experiments (5th International Conference VSTTE), Atherton, USA, E. Cohen, A. Rybalchenko (editors), Lecture Notes in Computer Science, Springer, May 2013, vol. 8164, pp. 191–201.
http://hal.inria.fr/hal-00875395
[51]
F. Bobot, J.-C. Filliâtre, C. Marché, G. Melquiond, A. Paskevich.
The Why3 platform, version 0.81, version 0.81, LRI, CNRS & Univ. Paris-Sud & Inria Saclay, March 2013.
http://hal.inria.fr/hal-00822856/
[52]
M. Bodin, A. Charguéraud, D. Filaretti, P. Gardner, S. Maffeis, D. Naudziuniene, A. Schmitt, G. Smith.
A Trusted Mechanised JavaScript Specification, in: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Diego, USA, ACM Press, January 2014.
http://hal.inria.fr/hal-00910135
[53]
S. Boldo.
How to Compute the Area of a Triangle: a Formal Revisit, in: Proceedings of the 21th IEEE Symposium on Computer Arithmetic, Austin, Texas, USA, 2013.
http://hal.inria.fr/hal-00790071
[54]
S. Boldo.
Deductive Formal Verification: How To Make Your Floating-Point Programs Behave, Université Paris-Sud, October 2014, Thèse d'habilitation.
https://hal.inria.fr/tel-01089643
[55]
S. Boldo.
Formal verification of tricky numerical computations, in: 16th GAMM-IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, Würzburg, Germany, September 2014.
https://hal.inria.fr/hal-01088692
[56]
S. Boldo, F. Clément, J.-C. Filliâtre, M. Mayero, G. Melquiond, P. Weis.
Formal Proof of a Wave Equation Resolution Scheme: the Method Error, in: Proceedings of the First Interactive Theorem Proving Conference, Edinburgh, Scotland, M. Kaufmann, L. C. Paulson (editors), LNCS, Springer, July 2010, vol. 6172, pp. 147–162.
http://hal.inria.fr/inria-00450789/
[57]
S. Boldo, F. Clément, J.-C. Filliâtre, M. Mayero, G. Melquiond, P. Weis.
Trusting Computations: a Mechanized Proof from Partial Differential Equations to Actual Program, in: Computers and Mathematics with Applications, 2014, vol. 68, no 3, pp. 325–352.
http://hal.inria.fr/hal-00769201
[58]
S. Boldo, F. Faissole, A. Chapoutot.
Round-off Error Analysis of Explicit One-Step Numerical Integration Methods, in: 24th IEEE Symposium on Computer Arithmetic, London, United Kingdom, July 2017.
https://hal.archives-ouvertes.fr/hal-01581794
[59]
S. Boldo, J.-C. Filliâtre, G. Melquiond.
Combining Coq and Gappa for Certifying Floating-Point Programs, in: 16th Symposium on the Integration of Symbolic Computation and Mechanised Reasoning, Grand Bend, Canada, Lecture Notes in Artificial Intelligence, Springer, July 2009, vol. 5625, pp. 59–74.
[60]
S. Boldo, J.-H. Jourdan, X. Leroy, G. Melquiond.
A Formally-Verified C Compiler Supporting Floating-Point Arithmetic, in: Proceedings of the 21th IEEE Symposium on Computer Arithmetic, Austin, Texas, USA, 2013.
http://hal.inria.fr/hal-00743090
[61]
S. Boldo, J.-H. Jourdan, X. Leroy, G. Melquiond.
Verified Compilation of Floating-Point Computations, in: Journal of Automated Reasoning, February 2015, vol. 54, no 2, pp. 135-163.
https://hal.inria.fr/hal-00862689
[62]
S. Boldo, C. Lelay, G. Melquiond.
Improving Real Analysis in Coq: a User-Friendly Approach to Integrals and Derivatives, in: Proceedings of the Second International Conference on Certified Programs and Proofs, Kyoto, Japan, C. Hawblitzel, D. Miller (editors), Lecture Notes in Computer Science, December 2012, vol. 7679, pp. 289–304.
http://hal.inria.fr/hal-00712938
[63]
S. Boldo, C. Lelay, G. Melquiond.
Coquelicot: A User-Friendly Library of Real Analysis for Coq, in: Mathematics in Computer Science, June 2015, vol. 9, no 1, pp. 41-62.
http://hal.inria.fr/hal-00860648
[64]
S. Boldo, C. Lelay, G. Melquiond.
Formalization of Real Analysis: A Survey of Proof Assistants and Libraries, in: Mathematical Structures in Computer Science, 2016.
http://hal.inria.fr/hal-00806920
[65]
S. Boldo, C. Marché.
Formal verification of numerical programs: from C annotated programs to mechanical proofs, in: Mathematics in Computer Science, 2011, vol. 5, pp. 377–393.
http://hal.inria.fr/hal-00777605
[66]
S. Boldo, T. M. T. Nguyen.
Proofs of numerical programs when the compiler optimizes, in: Innovations in Systems and Software Engineering, 2011, vol. 7, pp. 151–160.
http://hal.inria.fr/hal-00777639
[67]
T. Bormer, M. Brockschmidt, D. Distefano, G. Ernst, J.-C. Filliâtre, R. Grigore, M. Huisman, V. Klebanov, C. Marché, R. Monahan, W. Mostowski, N. Polikarpova, C. Scheben, G. Schellhorn, B. Tofan, J. Tschannen, M. Ulbrich.
The COST IC0701 Verification Competition 2011, in: Formal Verification of Object-Oriented Software, Revised Selected Papers Presented at the International Conference, FoVeOOS 2011, B. Beckert, F. Damiani, D. Gurov (editors), Lecture Notes in Computer Science, Springer, 2012, vol. 7421.
http://hal.inria.fr/hal-00789525
[68]
L. Burdy, Y. Cheon, D. R. Cok, M. D. Ernst, J. R. Kiniry, G. T. Leavens, K. R. M. Leino, E. Poll.
An overview of JML tools and applications, in: International Journal on Software Tools for Technology Transfer (STTT), June 2005, vol. 7, no 3, pp. 212–232.
[69]
R. Chapman, F. Schanda.
Are We There Yet? 20 Years of Industrial Theorem Proving with SPARK, in: Interactive Theorem Proving - 5th International Conference, ITP 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings, G. Klein, R. Gamboa (editors), Lecture Notes in Computer Science, Springer, 2014, vol. 8558, pp. 17–26.
[70]
A. Charguéraud, F. Pottier.
Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits, in: Journal of Automated Reasoning, September 2017.
[71]
M. Clochard.
Automatically verified implementation of data structures based on AVL trees, in: 6th Working Conference on Verified Software: Theories, Tools and Experiments (VSTTE), Vienna, Austria, D. Giannakopoulou, D. Kroening (editors), Lecture Notes in Computer Science, Springer, July 2014, vol. 8471, pp. 167–180.
http://hal.inria.fr/hal-01067217
[72]
M. Clochard, J.-C. Filliâtre, C. Marché, A. Paskevich.
Formalizing Semantics with an Automatic Program Verifier, in: 6th Working Conference on Verified Software: Theories, Tools and Experiments (VSTTE), Vienna, Austria, D. Giannakopoulou, D. Kroening (editors), Lecture Notes in Computer Science, Springer, July 2014, vol. 8471, pp. 37–51.
http://hal.inria.fr/hal-01067197
[73]
M. Clochard, L. Gondelman.
Double WP: vers une preuve automatique d'un compilateur, in: Vingt-sixièmes Journées Francophones des Langages Applicatifs, Val d'Ajol, France, January 2015.
https://hal.inria.fr/hal-01094488
[74]
M. Clochard, L. Gondelman, M. Pereira.
The Matrix Reproved, in: 8th Working Conference on Verified Software: Theories, Tools and Experiments (VSTTE), Toronto, Canada, S. Blazy, M. Chechik (editors), Lecture Notes in Computer Science, Springer, July 2016.
https://hal.inria.fr/hal-01316902
[75]
M. Clochard, C. Marché, A. Paskevich.
Verified Programs with Binders, in: Programming Languages meets Program Verification (PLPV), ACM Press, 2014.
http://hal.inria.fr/hal-00913431
[76]
S. Conchon.
SMT Techniques and their Applications: from Alt-Ergo to Cubicle, Université Paris-Sud, December 2012, In English, http://www.lri.fr/~conchon/publis/conchonHDR.pdf, Thèse d'habilitation.
[77]
S. Conchon, É. Contejean, M. Iguernelala.
Canonized Rewriting and Ground AC Completion Modulo Shostak Theories, in: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrücken, Germany, P. A. Abdulla, K. R. M. Leino (editors), Lecture Notes in Computer Science, Springer, April 2011, vol. 6605, pp. 45-59.
http://hal.inria.fr/hal-00777663
[78]
S. Conchon, É. Contejean, M. Iguernelala.
Canonized Rewriting and Ground AC Completion Modulo Shostak Theories : Design and Implementation, in: Logical Methods in Computer Science, September 2012, vol. 8, no 3, pp. 1–29.
http://hal.inria.fr/hal-00798082
[79]
S. Conchon, D. Declerck, L. Maranget, A. Mebsout.
Vérification de programmes C concurrents avec Cubicle : Enfoncer les barrières, in: Vingt-cinquièmes Journées Francophones des Langages Applicatifs, Fréjus, France, January 2014.
https://hal.inria.fr/hal-01088655
[80]
S. Conchon, A. Goel, S. Krstić, A. Mebsout, F. Zaïdi.
Invariants for Finite Instances and Beyond, in: FMCAD, Portland, Oregon, États-Unis, October 2013, pp. 61–68.
http://hal.archives-ouvertes.fr/hal-00924640
[81]
S. Conchon, M. Iguernelala.
Tuning the Alt-Ergo SMT Solver for B Proof Obligations, in: Abstract State Machines, Alloy, B, VDM, and Z (ABZ), Toulouse, France, Lecture Notes in Computer Science, Springer, June 2014, vol. 8477, pp. 294–297.
https://hal.inria.fr/hal-01093000
[82]
S. Conchon, M. Iguernelala, A. Mebsout.
A Collaborative Framework for Non-Linear Integer Arithmetic Reasoning in Alt-Ergo, 2013.
https://hal.archives-ouvertes.fr/hal-00924646
[83]
S. Conchon, A. Mebsout, F. Zaïdi.
Vérification de systèmes paramétrés avec Cubicle, in: Vingt-quatrièmes Journées Francophones des Langages Applicatifs, Aussois, France, February 2013.
http://hal.inria.fr/hal-00778832
[84]
S. Conchon, G. Melquiond, C. Roux, M. Iguernelala.
Built-in Treatment of an Axiomatic Floating-Point Theory for SMT Solvers, in: SMT workshop, Manchester, UK, P. Fontaine, A. Goel (editors), LORIA, 2012, pp. 12–21.
[85]
M. Dahlweid, M. Moskal, T. Santen, S. Tobies, W. Schulte.
VCC: Contract-based modular verification of concurrent C, in: 31st International Conference on Software Engineering, ICSE 2009, May 16-24, 2009, Vancouver, Canada, Companion Volume, IEEE Comp. Soc. Press, 2009, pp. 429-430.
[86]
D. Delahaye, C. Dubois, C. Marché, D. Mentré.
The BWare Project: Building a Proof Platform for the Automated Verification of B Proof Obligations, in: Abstract State Machines, Alloy, B, VDM, and Z (ABZ), Toulouse, France, Lecture Notes in Computer Science, Springer, June 2014, vol. 8477, pp. 290–293.
http://hal.inria.fr/hal-00998092/en/
[87]
D. Delahaye, C. Marché, D. Mentré.
Le projet BWare : une plate-forme pour la vérification automatique d'obligations de preuve B, in: Approches Formelles dans l'Assistance au Développement de Logiciels (AFADL), Paris, France, EasyChair, June 2014.
http://hal.inria.fr/hal-00998094/en/
[88]
C. Dross, S. Conchon, J. Kanig, A. Paskevich.
Reasoning with Triggers, in: SMT workshop, Manchester, UK, P. Fontaine, A. Goel (editors), LORIA, 2012.
[89]
C. Dross.
Generic Decision Procedures for Axiomatic First-Order Theories, Université Paris-Sud, April 2014.
http://tel.archives-ouvertes.fr/tel-01002190
[90]
F. Faissole.
Formalization and closedness of finite dimensional subspaces, in: SYNASC 2017 - 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Timișoara, Romania, September 2017.
[91]
F. Faissole, B. Spitters.
Synthetic topology in homotopy type theory for probabilistic programming, January 2017, PPS 2017 - Workshop on probabilistic programming semantics.
https://hal.inria.fr/hal-01485397
[92]
F. Faissole, B. Spitters.
Synthetic topology in HoTT for probabilistic programming, in: The Third International Workshop on Coq for Programming Languages (CoqPL 2017), Paris, France, January 2017.
https://hal.inria.fr/hal-01405762
[93]
J.-C. Filliâtre.
Combining Interactive and Automated Theorem Proving in Why3 (invited talk), in: Automation in Proof Assistants 2012, Tallinn, Estonia, K. Heljanko, H. Herbelin (editors), April 2012.
[94]
J.-C. Filliâtre.
Combining Interactive and Automated Theorem Proving using Why3 (invited tutorial), in: Second International Workshop on Intermediate Verification Languages (BOOGIE 2012), Berkeley, California, USA, Z. Rakamarić (editor), July 2012.
[95]
J.-C. Filliâtre.
Verifying Two Lines of C with Why3: an Exercise in Program Verification, in: Verified Software: Theories, Tools, Experiments (4th International Conference VSTTE), Philadelphia, USA, R. Joshi, P. Müller, A. Podelski (editors), Lecture Notes in Computer Science, Springer, January 2012, vol. 7152, pp. 83–97.
[96]
J.-C. Filliâtre.
Deductive Program Verification, in: Programming Languages Mentoring Workshop (PLMW 2013), Rome, Italy, N. Foster, P. Gardner, A. Schmitt, G. Smith, P. Thieman, T. Wrigstad (editors), January 2013.
http://hal.inria.fr/hal-00799190
[97]
J.-C. Filliâtre.
One Logic To Use Them All, in: 24th International Conference on Automated Deduction (CADE-24), Lake Placid, USA, Lecture Notes in Artificial Intelligence, Springer, June 2013, vol. 7898, pp. 1–20.
http://hal.inria.fr/hal-00809651/en/
[98]
J.-C. Filliâtre, A. Paskevich.
Why3 — Where Programs Meet Provers, in: Proceedings of the 22nd European Symposium on Programming, M. Felleisen, P. Gardner (editors), Lecture Notes in Computer Science, Springer, March 2013, vol. 7792, pp. 125–128.
http://hal.inria.fr/hal-00789533
[99]
J.-C. Filliâtre, A. Paskevich, A. Stump.
The 2nd Verified Software Competition: Experience Report, in: COMPARE2012: 1st International Workshop on Comparative Empirical Evaluation of Reasoning Systems, Manchester, UK, V. Klebanov, S. Grebing (editors), EasyChair, June 2012.
http://hal.inria.fr/hal-00798777
[100]
J.-C. Filliâtre, M. Pereira.
Producing All Ideals of a Forest, Formally (Verification Pearl), in: 8th Working Conference on Verified Software: Theories, Tools and Experiments (VSTTE), Toronto, Canada, S. Blazy, M. Chechik (editors), Lecture Notes in Computer Science, Springer, July 2016.
https://hal.inria.fr/hal-01316859
[101]
D. Hauzar, C. Marché, Y. Moy.
Counterexamples from Proof Failures in SPARK, in: Software Engineering and Formal Methods, Vienna, Austria, R. De Nicola, E. Kühn (editors), Lecture Notes in Computer Science, 2016, pp. 215–233.
https://hal.inria.fr/hal-01314885
[102]
D. Hauzar, C. Marché, Y. Moy.
Counterexamples from proof failures in the SPARK program verifier, Inria Saclay Ile-de-France, February 2016, no RR-8854.
https://hal.inria.fr/hal-01271174
[103]
P. Herms.
Certification of a Tool Chain for Deductive Program Verification, Université Paris-Sud, January 2013.
http://tel.archives-ouvertes.fr/tel-00789543
[104]
P. Herms, C. Marché, B. Monate.
A Certified Multi-prover Verification Condition Generator, in: Verified Software: Theories, Tools, Experiments (4th International Conference VSTTE), Philadelphia, USA, R. Joshi, P. Müller, A. Podelski (editors), Lecture Notes in Computer Science, Springer, January 2012, vol. 7152, pp. 2–17.
http://hal.inria.fr/hal-00639977
[105]
M. Iguernelala.
Strengthening the Heart of an SMT-Solver: Design and Implementation of Efficient Decision Procedures, Université Paris-Sud, June 2013.
http://tel.archives-ouvertes.fr/tel-00842555
[106]
D. Ishii, G. Melquiond, S. Nakajima.
Inductive Verification of Hybrid Automata with Strongest Postcondition Calculus, in: Proceedings of the 10th Conference on Integrated Formal Methods, Turku, Finland, E. B. Johnsen, L. Petre (editors), Lecture Notes in Computer Science, 2013, vol. 7940, pp. 139–153.
http://hal.inria.fr/hal-00806701
[107]
J. Kanig, E. Schonberg, C. Dross.
Hi-Lite: the convergence of compiler technology and program verification, in: Proceedings of the 2012 ACM Conference on High Integrity Language Technology, HILT '12, Boston, USA, B. Brosgol, J. Boleng, S. T. Taft (editors), ACM Press, 2012, pp. 27–34.
[108]
G. Klein, J. Andronick, K. Elphinstone, G. Heiser, D. Cock, P. Derrin, D. Elkaduwe, K. Engelhardt, R. Kolanski, M. Norrish, T. Sewell, H. Tuch, S. Winwood.
seL4: Formal verification of an OS kernel, in: Communications of the ACM, June 2010, vol. 53, no 6, pp. 107–115.
[109]
C. Lelay.
A New Formalization of Power Series in Coq, in: 5th Coq Workshop, Rennes, France, July 2013, pp. 1–2.
http://hal.inria.fr/hal-00880212
[110]
C. Lelay.
Coq passe le bac, in: JFLA - Journées francophones des langages applicatifs, Fréjus, France, January 2014.
[111]
C. Lelay, G. Melquiond.
Différentiabilité et intégrabilité en Coq. Application à la formule de d'Alembert, in: Vingt-troisièmes Journées Francophones des Langages Applicatifs, Carnac, France, February 2012.
http://hal.inria.fr/hal-00642206/fr/
[112]
X. Leroy.
A formally verified compiler back-end, in: Journal of Automated Reasoning, 2009, vol. 43, no 4, pp. 363–446.
http://hal.inria.fr/inria-00360768/en/
[113]
A. Mahboubi, G. Melquiond, T. Sibut-Pinote.
Formally Verified Approximations of Definite Integrals, in: Proceedings of the 7th International Conference on Interactive Theorem Proving, Nancy, France, J. C. Blanchette, S. Merz (editors), Lecture Notes in Computer Science, August 2016, vol. 9807.
https://hal.inria.fr/hal-01289616
[114]
C. Marché, A. Tafat.
Weakest Precondition Calculus, revisited using Why3, Inria, December 2012, no RR-8185.
http://hal.inria.fr/hal-00766171
[115]
C. Marché, A. Tafat.
Calcul de plus faible précondition, revisité en Why3, in: Vingt-quatrièmes Journées Francophones des Langages Applicatifs, Aussois, France, February 2013.
http://hal.inria.fr/hal-00778791
[116]
C. Marché.
Verification of the Functional Behavior of a Floating-Point Program: an Industrial Case Study, in: Science of Computer Programming, March 2014, vol. 96, no 3, pp. 279–296.
http://hal.inria.fr/hal-00967124/en
[117]
É. Martin-Dorel, G. Melquiond, J.-M. Muller.
Some Issues related to Double Roundings, in: BIT Numerical Mathematics, 2013, vol. 53, no 4, pp. 897–924.
http://hal-ens-lyon.archives-ouvertes.fr/ensl-00644408
[118]
A. Mebsout.
Invariants inference for model checking of parameterized systems, Université Paris-Sud, September 2014.
https://tel.archives-ouvertes.fr/tel-01073980
[119]
G. Melquiond.
Floating-point arithmetic in the Coq system, in: Information and Computation, 2012, vol. 216, pp. 14–23.
http://hal.inria.fr/hal-00797913
[120]
G. Melquiond, W. G. Nowak, P. Zimmermann.
Numerical Approximation of the Masser-Gramain Constant to Four Decimal Digits: delta=1.819..., in: Mathematics of Computation, 2013, vol. 82, pp. 1235–1246.
http://hal.inria.fr/hal-00644166/en/
[121]
D. Mentré, C. Marché, J.-C. Filliâtre, M. Asuka.
Discharging Proof Obligations from Atelier B using Multiple Automated Provers, in: ABZ'2012 - 3rd International Conference on Abstract State Machines, Alloy, B and Z, Pisa, Italy, S. Reeves, E. Riccobene (editors), Lecture Notes in Computer Science, Springer, June 2012, vol. 7316, pp. 238–251.
http://hal.inria.fr/hal-00681781/en/
[122]
J.-M. Muller, N. Brisebarre, F. de Dinechin, C.-P. Jeannerod, V. Lefèvre, G. Melquiond, N. Revol, D. Stehlé, S. Torres.
Handbook of Floating-Point Arithmetic, Birkhäuser, 2010.
[123]
T. M. T. Nguyen, C. Marché.
Hardware-Dependent Proofs of Numerical Programs, in: Certified Programs and Proofs, J.-P. Jouannaud, Z. Shao (editors), Lecture Notes in Computer Science, Springer, December 2011, pp. 314–329.
http://hal.inria.fr/hal-00772508
[124]
T. M. T. Nguyen.
Taking architecture and compiler into account in formal proofs of numerical programs, Université Paris-Sud, June 2012.
http://tel.archives-ouvertes.fr/tel-00710193
[125]
M. Norrish.
C Formalised in HOL, University of Cambridge, November 1998.
[126]
M. Pereira, J.-C. Filliâtre, S. M. de Sousa.
ARMY: a Deductive Verification Platform for ARM Programs Using Why3, in: INForum 2012, September 2012.
[127]
M. Pereira.
Tools and Techniques for the Verification of Modular Stateful Code, Université Paris-Saclay, December 2018.
[128]
R. Rieu-Helft, C. Marché, G. Melquiond.
How to Get an Efficient yet Verified Arbitrary-Precision Integer Library, in: 9th Working Conference on Verified Software: Theories, Tools, and Experiments, Heidelberg, Germany, Lecture Notes in Computer Science, July 2017, vol. 10712, pp. 84–101.
https://hal.inria.fr/hal-01519732
[129]
P. Roux.
Formal Proofs of Rounding Error Bounds, in: Journal of Automated Reasoning, 2015.
https://hal.archives-ouvertes.fr/hal-01091189
[130]
N. Schirmer.
Verification of Sequential Imperative Programs in Isabelle/HOL, Technische Universität München, 2006.
[131]
A. Tafat.
Preuves par raffinement de programmes avec pointeurs, Université Paris-Sud, September 2013.
http://tel.archives-ouvertes.fr/tel-00874679
[132]
F. de Dinechin, C. Lauter, G. Melquiond.
Certifying the floating-point implementation of an elementary function using Gappa, in: IEEE Transactions on Computers, 2011, vol. 60, no 2, pp. 242–253.
http://hal.inria.fr/inria-00533968/en/
[133]
L. de Moura, N. Bjørner.
Z3, An Efficient SMT Solver, in: TACAS, Lecture Notes in Computer Science, Springer, 2008, vol. 4963, pp. 337–340.