Bibliography

Major publications by the team in recent years

• 1G. Barthe, B. Grégoire, S. Heraud, S. Z. Béguelin.
  
  Computer-Aided Security Proofs for the Working Cryptographer, in: Advances in Cryptology - CRYPTO 2011 - 31st Annual Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2011. Proceedings, Lecture Notes in Computer Science, Springer, 2011, vol. 6841, pp. 71-90, Best Paper Award.
• 2Y. Bertot, P. Castéran.
  
  Interactive Theorem Proving and Program Development, Coq'Art:the Calculus of Inductive Constructions, Springer-Verlag, 2004.
• 3Y. Bertot, G. Gonthier, S. O. Biha, I. Paşca.
  
  Canonical Big Operators, in: Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2008), Lecture Notes in Computer Science, Springer, August 2008, vol. 5170, pp. 12–16.
  
  http://hal.inria.fr/inria-00331193/
• 4G. Gonthier, A. Asperti, J. Avigad, Y. Bertot, C. Cohen, F. Garillot, S. Le Roux, A. Mahboubi, R. O'Connor, S. Ould Biha, I. Paşca, L. Rideau, A. Solovyev, E. Tassi, L. Théry.
  
  A Machine-Checked Proof of the Odd Order Theorem, in: ITP 2013, 4th Conference on Interactive Theorem Proving, Rennes, France, S. Blazy, C. Paulin, D. Pichardie (editors), LNCS, Springer, 2013, vol. 7998, pp. 163-179. [ DOI : 10.1007/978-3-642-39634-2_14 ]
  
  http://hal.inria.fr/hal-00816699
• 5G. Gonthier, A. Mahboubi, L. Rideau, E. Tassi, L. Théry.
  
  A Modular Formalisation of Finite Group Theory, in: Proceedings of the 20th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2007), K. Schneider, J. Brandt (editors), LNCS, Springer-Verlag, September 2007, vol. 4732, pp. 86-101.
  
  http://hal.inria.fr/inria-00139131

Publications of the year

Articles in International Peer-Reviewed Journals

• 6R. Affeldt, C. Cohen, D. Rouhling.
  
  Formalization Techniques for Asymptotic Reasoning in Classical Analysis, in: Journal of Formalized Reasoning, October 2018.
  
  https://hal.inria.fr/hal-01719918
• 7B. Ahrens, R. Matthes, A. Mörtberg.
  
  From signatures to monads in UniMath, in: Journal of Automated Reasoning, July 2018, pp. 1-34. [ DOI : 10.1007/s10817-018-9474-4 ]
  
  https://hal.inria.fr/hal-01410487
• 8G. Barthe, T. Espitau, B. Grégoire, J. Hsu, P.-Y. Strub.
  
  Proving expected sensitivity of probabilistic programs, in: Proceedings of the ACM on Programming Languages, January 2018, vol. 2, n^o POPL, pp. 1-29. [ DOI : 10.1145/3158145 ]
  
  https://hal.archives-ouvertes.fr/hal-01959322
• 9B. Grégoire, G. Bonnet, F. Pedraza.
  
  Mechanisms of formation of slurry aluminide coatings from Al and Cr microparticles, in: Surface and Coatings Technology, February 2019, vol. 359, pp. 323-333.
  
  https://hal.archives-ouvertes.fr/hal-01980488

Invited Conferences

• 10Y. Bertot.
  
  Formal Verification of a Geometry Algorithm: A Quest for Abstract Views and Symmetry in Coq Proofs, in: ICTAC 2018 - International Colloquium on Theoretical of Computing, Stellenbosch, South Africa, October 2018, https://arxiv.org/abs/1809.00559.
  
  https://hal.inria.fr/hal-01866271

International Conferences with Proceedings

• 11A. Anand, S. Boulier, C. Cohen, M. Sozeau, N. Tabareau.
  
  Towards Certified Meta-Programming with Typed Template-Coq, in: ITP 2018 - 9th Conference on Interactive Theorem Proving, Oxford, United Kingdom, LNCS, Springer, July 2018, vol. 10895, pp. 20-39. [ DOI : 10.1007/978-3-319-94821-8_2 ]
  
  https://hal.archives-ouvertes.fr/hal-01809681
• 12C. Baritel-Ruet, F. Dupressoir, P.-A. Fouque, B. Grégoire.
  
  Formal Security Proof of CMAC and Its Variants, in: CSF 2018 - 31st EEE Computer Security Foundations Symposium, Oxford, United Kingdom, July 2018.
  
  https://hal.archives-ouvertes.fr/hal-01959554
• 13G. Barthe, S. Belaïd, T. Espitau, P.-A. Fouque, B. Grégoire, M. Rossi, M. Tibouchi.
  
  Masking the GLP Lattice-Based Signature Scheme at Any Order, in: Eurocrypt 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, J. B. Nielse, V. Rijme (editors), Lecture Notes in Computer Science, Springer, April 2018, vol. 10821, pp. 354-384. [ DOI : 10.1007/978-3-319-78375-8_12 ]
  
  https://hal.inria.fr/hal-01900708
• 14G. Barthe, T. Espitau, M. Gaboardi, B. Grégoire, J. Hsu, P.-Y. Strub.
  
  An Assertion-Based Program Logic for Probabilistic Programs, in: Programming Languages and Systems - 27th European Symposium on Programming, ESOP 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings, Thessaloniki, Greece, Programming Languages and Systems - 27th European Symposium on Programming, ESOP 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings, April 2018, pp. 117-144.
  
  https://hal.archives-ouvertes.fr/hal-01959567
• 15G. Barthe, X. Fan, J. Gancher, B. Grégoire, C. Jacomme, E. Shi.
  
  Symbolic Proofs for Lattice-Based Cryptography, in: CCS 2018 - Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security Canada, October 15-19, 2018, Toronto, Canada, ACM Press, October 2018, vol. 17, pp. 538-555. [ DOI : 10.1145/3243734.3243825 ]
  
  https://hal.archives-ouvertes.fr/hal-01959391
• 17B. Djalal.
  
  A Constructive Formalisation of Semi-algebraic Sets and Functions, in: Certified Programs and Proofs, Los Angeles, California, United States, J. Andronick, A. Felty (editors), January 2018.
  
  https://hal.inria.fr/hal-01643919
• 18B. Grégoire, K. Papagiannopoulos, P. Schwabe, K. Stoffelen.
  
  Vectorizing Higher-Order Masking, in: COSADE 2018 - Constructive Side-Channel Analysis and Secure Design - 9th International Workshop, Singapore, Singapore, April 2018, pp. 23-43.
  
  https://hal.archives-ouvertes.fr/hal-01959418
• 19D. Rouhling.
  
  A Formal Proof in Coq of a Control Function for the Inverted Pendulum, in: CPP 2018 - 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, Los Angeles, United States, January 2018, pp. 1-14. [ DOI : 10.1145/3167101 ]
  
  https://hal.inria.fr/hal-01639819

Internal Reports

• 20J. Grimm.
  
  Implementation of Bourbaki's Elements of Mathematics in Coq: Part Two; Ordered Sets, Cardinals, Integers, Inria Sophia Antipolis ; Inria, 2018, n^o RR-7150, 826 p.
  
  https://hal.inria.fr/inria-00440786

Other Publications

• 21Y. Bertot.
  
  Formal study in Coq of pi computations using arithmetic-geometric means, April 2018, https://archive.softwareheritage.org/swh:1:rev:b1e197c030e66d588987087a193fc3a88d8bd5ed, Software.
  
  https://hal.inria.fr/hal-01767263
• 22R. Chen, C. Cohen, J.-J. Levy, S. Merz, L. Théry.
  
  Formal Proofs of Tarjan's Algorithm in Why3, Coq, and Isabelle, October 2018, https://arxiv.org/abs/1810.11979 - working paper or preprint.
  
  https://hal.inria.fr/hal-01906155
• 23T. Coq Development Team.
  
  The Coq Proof Assistant, version 8.8.0, April 2018, Software. [ DOI : 10.5281/zenodo.1219885 ]
  
  https://hal.inria.fr/hal-01954564
• 24F. Guidi, C. Sacerdoti Coen, E. Tassi.
  
  Implementing Type Theory in Higher Order Constraint Logic Programming, November 2018, working paper or preprint.
  
  https://hal.inria.fr/hal-01410567
• 25E. Tassi.
  
  Deriving proved equality tests in Coq-elpi (Stronger induction principles for containers in Coq), October 2018, working paper or preprint.
  
  https://hal.inria.fr/hal-01897468
• 26E. Tassi.
  
  Elpi: an extension language for Coq (Metaprogramming Coq in the Elpi λProlog dialect), January 2018, working paper or preprint.
  
  https://hal.inria.fr/hal-01637063

References in notes

• 27M. Joldes, V. Popescu, J.-M. Muller.
  
  Tight and rigourous error bounds for basic building blocks of double-word arithmetic, July 2016, working paper or preprint.
  
  https://hal.archives-ouvertes.fr/hal-01351529