EN FR
EN FR


previous Previous | up Home


Bibliography

Major publications by the team in recent years
  • 1P. Audebaud, C. Paulin-Mohring.

    Proofs of Randomized Algorithms in Coq, in: Science of Computer Programming, 2009, vol. 74, no 8, pp. 568–589.

    http://hal.inria.fr/inria-00431771/en/
  • 2F. Bobot, J.-C. Filliâtre, C. Marché, A. Paskevich.

    Why3: Shepherd Your Herd of Provers, in: Boogie 2011: First International Workshop on Intermediate Verification Languages, Wrocław, Poland, August 2011, pp. 53–64.

    http://hal.inria.fr/hal-00790310
  • 3F. Bobot, A. Paskevich.

    Expressing Polymorphic Types in a Many-Sorted Language, in: Frontiers of Combining Systems, 8th International Symposium, Proceedings, Saarbrücken, Germany, C. Tinelli, V. Sofronie-Stokkermans (editors), Lecture Notes in Computer Science, October 2011, vol. 6989, pp. 87–102.
  • 4S. Boldo.

    Floats & Ropes: a case study for formal numerical program verification, in: 36th International Colloquium on Automata, Languages and Programming, Rhodos, Greece, Lecture Notes in Computer Science - ARCoSS, Springer, July 2009, vol. 5556, pp. 91–102.
  • 5S. 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
  • 6S. Boldo, G. Melquiond.

    Flocq: A Unified Library for Proving Floating-point Algorithms in Coq, in: Proceedings of the 20th IEEE Symposium on Computer Arithmetic, Tübingen, Germany, E. Antelo, D. Hough, P. Ienne (editors), 2011, pp. 243–252.

    http://hal.archives-ouvertes.fr/inria-00534854/
  • 7S. 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
  • 8É. Contejean, P. Courtieu, J. Forest, O. Pons, X. Urbain.

    Automated Certified Proofs with CiME3, in: 22nd International Conference on Rewriting Techniques and Applications (RTA 11), Novi Sad, Serbia, M. Schmidt-Schauß (editor), Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2011, vol. 10, pp. 21–30.

    http://hal.inria.fr/hal-00777669
  • 9J.-C. Filliâtre.

    Deductive Program Verification, Université Paris-Sud, December 2011, Thèse d'habilitation.
  • 10G. Melquiond.

    Proving bounds on real-valued functions with computations, in: Proceedings of the 4th International Joint Conference on Automated Reasoning, Sydney, Australia, A. Armando, P. Baumgartner, G. Dowek (editors), Lecture Notes in Artificial Intelligence, 2008, vol. 5195, pp. 2–17.
  • 11Y. Moy, C. Marché.

    Modular Inference of Subprogram Contracts for Safety Checking, in: Journal of Symbolic Computation, 2010, vol. 45, pp. 1184-1211.

    http://hal.inria.fr/inria-00534331/en/
Publications of the year

Doctoral Dissertations and Habilitation Theses

  • 12P. Herms.

    Certification of a Tool Chain for Deductive Program Verification, Université Paris Sud - Paris XI, January 2013.

    http://hal.inria.fr/tel-00789543
  • 13M. Iguernelala.

    Strengthening the heart of an SMT-solver : Design and implementation of efficient decision procedures, Université Paris Sud - Paris XI, June 2013.

    http://hal.inria.fr/tel-00842555
  • 14A. Tafat.

    Preuves par raffinement de programmes avec pointeurs, Université Paris Sud - Paris XI, September 2013.

    http://hal.inria.fr/tel-00874679

Articles in International Peer-Reviewed Journals

  • 15S. 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. [ DOI : 10.1007/s10817-012-9255-4 ]

    http://hal.inria.fr/hal-00649240
  • 16É. Martin-Dorel, G. Melquiond, J.-M. Muller.

    Some issues related to double roundings, in: BIT Numerical Mathematics, December 2013, vol. 53, no 4, pp. 897-924. [ DOI : 10.1007/s10543-013-0436-2 ]

    http://hal.inria.fr/ensl-00644408
  • 17G. 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. [ DOI : 10.1090/S0025-5718-2012-02635-4 ]

    http://hal.inria.fr/hal-00644166

Invited Conferences

  • 18J.-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), Nate Foster and Philippa Gardner and Alan Schmitt and Gareth Smith and Peter Thieman and Tobias Wrigstad, January 2013.

    http://hal.inria.fr/hal-00799190
  • 19J.-C. Filliâtre.

    One Logic To Use Them All, in: CADE 24 - the 24th International Conference on Automated Deduction, Lake Placid, NY, United States, M. P. Bonacina (editor), Springer, April 2013.

    http://hal.inria.fr/hal-00809651

International Conferences with Proceedings

  • 20U. Acar, A. Charguéraud, M. Rainey.

    Scheduling Parallel Programs by Work Stealing with Private Deques, in: PPOPP - 18th ACM SIGPLAN symposium on Principles and practice of parallel programming, Shenzhen, China, ACM New York, NY, USA, February 2013, pp. 219-228.

    http://hal.inria.fr/hal-00863028
  • 21V. Benzaken, É. Contejean, S. Dumbrava.

    A Coq Formalization of the Relational Data Model, in: ESOP - 23rd European Symposium on Programming, Grenoble, France, Z. Shao (editor), Lecture Notes in Computer Science, Springer, 2014.

    http://hal.inria.fr/hal-00924156
  • 22J. Blanchette, A. Paskevich.

    TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism, in: CADE - 24th International Conference on Automated Deduction - 2013, Lake Placid, NY, United States, 2013.

    http://hal.inria.fr/hal-00825086
  • 23F. Bobot, J.-C. Filliâtre, C. Marché, G. Melquiond, A. Paskevich.

    Preserving User Proofs Across Specification Changes, in: Fifth Working Conference on Verified Software: Theories, Tools and Experiments, Atherton, United States, E. Cohen, A. Rybalchenko (editors), Springer, 2013, vol. 8164, pp. 191-201.

    http://hal.inria.fr/hal-00875395
  • 24M. Bodin, A. Charguéraud, D. Filaretti, P. Gardner, S. Maffeis, D. Naudziuniene, A. Schmitt, G. Smith.

    A Trusted Mechanised JavaScript Specification, in: POPL 2014 - 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Diego, United States, November 2013.

    http://hal.inria.fr/hal-00910135
  • 25S. Boldo.

    How to Compute the Area of a Triangle: a Formal Revisit, in: 21st IEEE International Symposium on Computer Arithmetic, Austin, TX, United States, A. Nannarelli, P.-M. Seidel, P. T. P. Tang (editors), IEEE, April 2013, pp. 91-98. [ DOI : 10.1109/ARITH.2013.29 ]

    http://hal.inria.fr/hal-00790071
  • 26S. Boldo, J.-H. Jourdan, X. Leroy, G. Melquiond.

    A Formally-Verified C Compiler Supporting Floating-Point Arithmetic, in: Arith - 21st IEEE Symposium on Computer Arithmetic, Austin, United States, A. Nannarelli, P.-M. Seidel, P. T. P. Tang (editors), IEEE, 2013, pp. 107-115.

    http://hal.inria.fr/hal-00743090
  • 27A. Charguéraud.

    Pretty-Big-Step Semantics, in: 22nd European Symposium on Programming (ESOP), Rome, Italy, M. Felleisen, P. Gardner (editors), Springer, March 2013.

    http://hal.inria.fr/hal-00798227
  • 28S. Chaudhuri, M. Clochard, A. Solar-Lezama.

    Bridging Boolean and Quantitative Synthesis Using Smoothed Proof Search, in: POPL - 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Diego, United States, ACM Press, January 2014.

    http://hal.inria.fr/hal-00920955
  • 29M. Clochard, C. Marché, A. Paskevich.

    Verified Programs with Binders, in: Programming Languages meets Program Verification, San Diego, United States, ACM Press, January 2014.

    http://hal.inria.fr/hal-00913431
  • 30S. Conchon, A. Goel, S. Krstić, A. Mebsout, F. Zaïdi.

    Invariants for Finite Instances and Beyond, in: Formal Methods in Computer-Aided Design (FMCAD), Portland, Oregon, United States, October 2013, pp. 61-68. [ DOI : 10.1109/FMCAD.2013.6679392 ]

    http://hal.inria.fr/hal-00924640
  • 31S. Conchon, A. Mebsout, F. Zaïdi.

    Vérification de systèmes paramétrés avec Cubicle, in: JFLA - Journées francophones des langages applicatifs - 2013, Aussois, France, D. Pous, C. Tasson (editors), Damien Pous and Christine Tasson, February 2013.

    http://hal.inria.fr/hal-00778832
  • 32R. El Sibaïe, J.-C. Filliâtre.

    combine : une bibliothèque OCaml pour la combinatoire, in: JFLA - Journées francophones des langages applicatifs, Aussois, France, D. Pous, C. Tasson (editors), Damien Pous and Christine Tasson, February 2013.

    http://hal.inria.fr/hal-00779431
  • 33J.-C. Filliâtre, A. Paskevich.

    Why3 – Where Programs Meet Provers, in: ESOP'13 22nd European Symposium on Programming, Rome, Italy, LNCS, Springer, March 2013, vol. 7792.

    http://hal.inria.fr/hal-00789533
  • 34D. Ishii, G. Melquiond, S. Nakajima.

    Inductive Verification of Hybrid Automata with Strongest Postcondition Calculus, in: iFM - 10th International Conference on Integrated Formal Methods - 2013, Turku, Finland, E. B. Johnsen, L. Petre (editors), Lecture Notes in Computer Science, Springer, 2013, vol. 7940, pp. 139-153. [ DOI : 10.1007/978-3-642-38613-8_10 ]

    http://hal.inria.fr/hal-00806701
  • 35C. Lelay.

    A New Formalization of Power Series in Coq, in: The 5th Coq Workshop, Rennes, France, July 2013.

    http://hal.inria.fr/hal-00880212
  • 36C. Marché, A. Tafat.

    Calcul de plus faible précondition, revisité en Why3, in: JFLA - Journées francophones des langages applicatifs - 2013, Aussois, France, D. Pous, C. Tasson (editors), Damien Pous and Christine Tasson, February 2013.

    http://hal.inria.fr/hal-00778791

Scientific Books (or Scientific Book chapters)

  • 37S. Blazy, C. Paulin-Mohring, D. Pichardie (editors)

    Interactive Theorem Proving - 4th International Conference, ITP 2013, Rennes, France, July 22-26, 2013. Proceedings., Lecture Notes in Computer Science, Springer, 2013, vol. 7998, 500 p. [ DOI : 10.1007/978-3-642-39634-2 ]

    http://hal.inria.fr/hal-00908865
  • 38E. Beffara, J.-D. Boissonnat, S. Boldo, F. Chazal, E. Gioan, M. Martel, C. Paul, G. Melquiond, J. Ramirez Alfonsin, L. Vaux, M. Yvinec.

    P. Langlois (editor), Informatique Mathématique : une photographie en 2013, Etudes, Presses Universitaires de Perpignan, April 2013, 283 p.

    http://hal.inria.fr/lirmm-00835506
  • 39J. Courant, M. de Falco, S. Gonnord, J.-C. Filliâtre, S. Conchon, G. Dowek, B. Wack.

    Informatique pour tous en classes préparatoires aux grandes écoles : Manuel d'algorithmique et programmation structurée avec Python, Eyrolles, 2013, 408 p.

    http://hal.inria.fr/hal-00880268

Internal Reports

  • 40U. Acar, A. Charguéraud, S. Muller, M. Rainey.

    Atomic Read-Modify-Write Operations are Unnecessary for Shared-Memory Work Stealing, September 2013.

    http://hal.inria.fr/hal-00910130
  • 41A. Rousseau, A. Darnaud, B. Goglin, C. Acharian, C. Leininger, C. Godin, C. Holik, C. Kirchner, D. Rives, E. Darquie, E. Kerrien, F. Neyret, F. Masseglia, F. Dufour, G. Berry, G. Dowek, H. Robak, H. Xypas, I. Illina, I. Gnaedig, J. Jongwane, J. Ehrel, L. Viennot, L. Guion, L. Calderan, L. Kovacic, M. Collin, M.-A. Enard, M.-H. Comte, M. Quinson, M. Olivi, M. Giraud, M. Dorémus, M. Ogouchi, M. Droin, N. Lacaux, N. Rougier, N. Roussel, P. Guitton, P. Peterlongo, R.-M. Cornus, S. Vandermeersch, S. Maheo, S. Lefebvre, S. Boldo, T. Viéville, V. Poirel, A. Chabreuil, A. Fischer, C. Farge, C. Vadel, I. Astic, J.-P. Dumont, L. Féjoz, P. Rambert, P. Paradinas, S. De Quatrebarbes, S. Laurent.

    Médiation Scientifique : une facette de nos métiers de la recherche, March 2013, 34 p.

    http://hal.inria.fr/hal-00804915

Other Publications

References in notes
  • 51A. 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
  • 52B. E. Aydemir, A. Bohannon, M. Fairbairn, J. N. Foster, B. C. Pierce, P. Sewell, D. Vytiniotis, G. Washburn, S. Weirich, S. Zdancewic.

    Mechanized metatheory for the masses: The POPLmark Challenge, in: Proceedings of the Eighteenth International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2005), Lecture Notes in Computer Science, Springer, 2005, no 3603, pp. 50–65.
  • 53T. Ball, R. Majumdar, T. Millstein, S. K. Rajamani.

    Automatic predicate abstraction of C programs, in: Proceedings of the ACM SIGPLAN 2001 conference on Programming Language Design and Implementation, ACM Press, 2001, pp. 203–213.
  • 54M. Barbosa, J.-C. Filliâtre, J. S. Pinto, B. Vieira.

    A Deductive Verification Platform for Cryptographic Software, in: 4th International Workshop on Foundations and Techniques for Open Source Software Certification (OpenCert 2010), Pisa, Italy, Electronic Communications of the EASST, September 2010, vol. 33.
  • 55R. Bardou.

    Verification of Pointer Programs Using Regions and Permissions, Université Paris-Sud, October 2011.

    http://tel.archives-ouvertes.fr/tel-00647331
  • 56R. Bardou, J.-C. Filliâtre, J. Kanig, S. Lescuyer.

    Faire bonne figure avec Mlpost, in: Vingtièmes Journées Francophones des Langages Applicatifs, Saint-Quentin sur Isère, Inria, January 2009.
  • 57B. Barras, B. Werner.

    Coq in Coq, 1997.
  • 58C. 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.
  • 59G. Barthe, B. Grégoire, S. Z. Béguelin.

    Formal certification of code-based cryptographic proofs, in: POPL, Savannah, GA, USA, Z. Shao, B. C. Pierce (editors), ACM Press, January 2009, pp. 90-101.
  • 60P. Baudin, J.-C. Filliâtre, C. Marché, B. Monate, Y. Moy, V. Prevosto.

    ACSL: ANSI/ISO C Specification Language, version 1.4, 2009.
  • 61P. 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, September 1999, pp. 369–387.
  • 62F. Bobot, S. Conchon, É. Contejean, M. Iguernelala, S. Lescuyer, A. Mebsout.

    The Alt-Ergo Automated Theorem Prover, 2008.
  • 63F. 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
  • 64S. Boldo.

    Preuves formelles en arithmétiques à virgule flottante, École Normale Supérieure de Lyon, 2004.
  • 65S. Boldo.

    Kahan's algorithm for a correct discriminant computation at last formally proven, in: IEEE Transactions on Computers, February 2009, vol. 58, no 2, pp. 220-225.

    http://hal.inria.fr/inria-00171497/en/
  • 66S. 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/
  • 67S. 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.
  • 68S. 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
  • 69S. Boldo, G. Melquiond.

    Emulation of FMA and Correctly-Rounded Sums: Proved Algorithms Using Rounding to Odd, in: IEEE Transactions on Computers, 2008, vol. 57, no 4, pp. 462–471.

    http://hal.inria.fr/inria-00080427/
  • 70S. Boldo, J.-M. Muller.

    Exact and Approximated error of the FMA, in: IEEE Transactions on Computers, February 2011, vol. 60, no 2, pp. 157–164.

    http://hal.inria.fr/inria-00429617/en/
  • 71S. 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
  • 72L. 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.
  • 73S. Böhme, T. Nipkow.

    Sledgehammer: Judgement Day, in: IJCAR, J. Giesl, R. Hähnle (editors), Lecture Notes in Computer Science, Springer, 2010, vol. 6173, pp. 107-121.
  • 74A. Charguéraud, F. Pottier.

    Functional Translation of a Calculus of Capabilities, in: ACM SIGPLAN International Conference on Functional Programming (ICFP), September 2008, pp. 213–224.
  • 75A. Charguéraud.

    Characteristic formulae for the verification of imperative programs, in: Proceeding of the 16th ACM SIGPLAN international conference on Functional Programming (ICFP), Tokyo, Japan, M. M. T. Chakravarty, Z. Hu, O. Danvy (editors), ACM, September 2011, pp. 418-430.
  • 76S. 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
  • 77S. 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.
  • 78É. Contejean.

    Coccinelle, a Coq library for rewriting, in: Types, Torino, Italy, March 2008.
  • 79É. Contejean, P. Courtieu, J. Forest, A. Paskevich, O. Pons, X. Urbain.

    A3PAT, an Approach for Certified Automated Termination Proofs, in: Partial Evaluation and Program Manipulation, Madrid, Spain, J. P. Gallagher, J. Voigtländer (editors), ACM Press, January 2010, pp. 63-72.
  • 80B. Cook.

    Static Driver Verifier.
  • 81P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné, D. Monniaux, X. Rival.

    The ASTRÉE Analyzer, in: ESOP, Lecture Notes in Computer Science, 2005, no 3444, pp. 21–30.
  • 82M. 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.
  • 83M. Daumas, G. Melquiond.

    Certification of bounds on expressions involving rounded operators, in: Transactions on Mathematical Software, 2010, vol. 37, no 1.

    http://hal.archives-ouvertes.fr/inria-00534350/fr/
  • 84C. Dross, S. Conchon, J. Kanig, A. Paskevich.

    Reasoning with Triggers, Inria, June 2012, no RR-7986, 29 p.

    http://hal.inria.fr/hal-00703207
  • 85C. Dross, S. Conchon, J. Kanig, A. Paskevich.

    Reasoning with Triggers, in: SMT workshop, Manchester, UK, P. Fontaine, A. Goel (editors), LORIA, 2012.
  • 86C. Dross, J.-C. Filliâtre, Y. Moy.

    Correct Code Containing Containers, in: 5th International Conference on Tests and Proofs (TAP'11), Zurich, Lecture Notes in Computer Science, Springer, June 2011, vol. 6706, pp. 102–118.

    http://hal.inria.fr/hal-00777683
  • 87J.-C. Filliâtre.

    Formal Verification of MIX Programs, in: Journées en l'honneur de Donald E. Knuth, Bordeaux, France, October 2007.
  • 88J.-C. Filliâtre.

    Deductive Software Verification, in: International Journal on Software Tools for Technology Transfer (STTT), August 2011, vol. 13, no 5, pp. 397-403.
  • 89J.-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.
  • 90J.-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.
  • 91J.-C. Filliâtre, K. Kalyanasundaram.

    Functory: A Distributed Computing Library for Objective Caml, in: Trends in Functional Programming, Madrid, Spain, Lecture Notes in Computer Science, May 2011, vol. 7193, pp. 65–81.
  • 92J.-C. Filliâtre, K. Kalyanasundaram.

    Une bibliothèque de calcul distribué pour Objective Caml, in: Vingt-deuxièmes Journées Francophones des Langages Applicatifs, La Bresse, France, S. Conchon (editor), Inria, January 2011.
  • 93J. Gerlach, J. Burghardt.

    An Experience Report on the Verification of Algorithms in the C++ Standard Library using Frama-C, in: Formal Verification of Object-Oriented Software, Papers Presented at the International Conference, Paris, France, B. Beckert, C. Marché (editors), Karlsruhe Reports in Informatics, June 2010, pp. 191–204.

    http://hal.inria.fr/hal-00772519
  • 94P. 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
  • 95K. Kalyanasundaram, C. Marché.

    Automated Generation of Loop Invariants using Predicate Abstraction, Inria, August 2011, no 7714.

    http://hal.inria.fr/inria-00615623/en/
  • 96J. Kanig, J.-C. Filliâtre.

    Who: A Verifier for Effectful Higher-order Programs, in: ACM SIGPLAN Workshop on ML, Edinburgh, Scotland, UK, August 2009.

    http://hal.inria.fr/hal-00777585
  • 97G. 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.
  • 98G. T. Leavens, K. R. M. Leino, P. Müller.

    Specification and verification challenges for sequential object-oriented programs, in: Formal Aspects of Computing, 2007.
  • 99K. R. M. Leino.

    Efficient weakest preconditions, in: Information Processing Letters, 2005, vol. 93, no 6, pp. 281-288.
  • 100C. 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/
  • 101X. 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/
  • 102S. Lescuyer.

    Formalisation et développement d'une tactique réflexive pour la démonstration automatique en Coq, Université Paris-Sud, January 2011.

    http://tel.archives-ouvertes.fr/tel-00713668
  • 103C. Marché.

    The Krakatoa tool for Deductive Verification of Java Programs, January 2009, Winter School on Object-Oriented Verification, Viinistu, Estonia.
  • 104G. Melquiond.

    De l'arithmétique d'intervalles à la certification de programmes, École Normale Supérieure de Lyon, 2006.
  • 105G. Melquiond.

    Floating-point arithmetic in the Coq system, in: Proceedings of the 8th Conference on Real Numbers and Computers, Santiago de Compostela, Spain, 2008, pp. 93–102.
  • 106G. Melquiond, S. Pion.

    Formally certified floating-point filters for homogeneous geometric predicates, in: Theoretical Informatics and Applications, 2007, vol. 41, no 1, pp. 57–70.
  • 107D. 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/
  • 108C. Morgan.

    Programming from specifications (2nd ed.), Prentice Hall International (UK) Ltd., 1994.
  • 109Y. Moy, C. Marché.

    The Jessie plugin for Deduction Verification in Frama-C — Tutorial and Reference Manual, Inria & LRI, 2011.
  • 110J.-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.
  • 111T. 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
  • 112T. 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
  • 113S. Ranise, C. Tinelli.

    The Satisfiability Modulo Theories Library (SMT-LIB), 2006.
  • 114S. M. Rump, P. Zimmermann, S. Boldo, G. Melquiond.

    Computing predecessor and successor in rounding to nearest, in: BIT, June 2009, vol. 49, no 2, pp. 419–431.

    http://hal.inria.fr/inria-00337537/
  • 115J. Smans, B. Jacobs, F. Piessens.

    Implicit Dynamic Frames: Combining Dynamic Frames and Separation Logic, in: ECOOP 2009 — Object-Oriented Programming, S. Drossopoulou (editor), Lecture Notes in Computer Science, Springer Berlin / Heidelberg, 2009, pp. 148-172.
  • 116A. J. Summers, S. Drossopoulou.

    Considerate Reasoning and the Composite Design Pattern, in: VMCAI, G. Barthe, M. V. Hermenegildo (editors), Lecture Notes in Computer Science, Springer, 2010, vol. 5944, pp. 328-344.
  • 117H. Tuch, G. Klein, M. Norrish.

    Types, Bytes, and Separation Logic, in: Proc. 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'07), Nice, France, M. Hofmann, M. Felleisen (editors), January 2007, pp. 97-108.
  • 118E. Tushkanova, A. Giorgetti, C. Marché, O. Kouchnarenko.

    Specifying Generic Java Programs: two case studies, in: Tenth Workshop on Language Descriptions, Tools and Applications, C. Brabrand, P.-E. Moreau (editors), ACM Press, 2010.

    http://hal.inria.fr/inria-00525784/en/
  • 119F. 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/
  • 120L. de Moura, N. Bjørner.

    Z3, An Efficient SMT Solver, in: TACAS, Lecture Notes in Computer Science, Springer, 2008, vol. 4963, pp. 337–340.


previous Previous | up Home