Members
Overall Objectives
Research Program
Application Domains
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]
G. 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.
[2]
Y. Bertot, P. Castéran.
Interactive Theorem Proving and Program Development, Coq'Art:the Calculus of Inductive Constructions, Springer-Verlag, 2004.
[3]
Y. 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/
[4]
G. Gonthier, A. Asperti, J. Avigad, Y. Bertot, C. Cohen, F. Garillot, S. Le Roux, A. Mahboubi, R. O'Connor, S. Ould Biha, I. Pasca, 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
[5]
G. 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

[6]
É. Martin-Dorel, G. Hanrot, M. Mayero, L. Théry.
Formally verified certificate checkers for hardest-to-round computation, in: Journal of Automated Reasoning, 2015, vol. 54, no 1, pp. 1-29. [ DOI : 10.1007/s10817-014-9312-2 ]
https://hal.inria.fr/hal-00919498

International Conferences with Proceedings

[7]
B. Barras, C. Tankink, E. Tassi.
Asynchronous processing of Coq documents: from the kernel up to the user interface, in: Proceedings of ITP, Nanjing, China, August 2015.
https://hal.inria.fr/hal-01135919
[8]
G. Barthe, S. Belaid, F. Dupressoir, P.-A. Fouque, B. Grégoire, P.-Y. Strub.
Verified Proofs of Higher-Order Masking, in: Advances in Cryptology – EUROCRYPT 2015, Sofia, Bulgaria, Lecture Notes in Computer Science, April 2015, vol. 9056. [ DOI : 10.1007/978-3-662-46800-5_18 ]
https://hal.inria.fr/hal-01216699
[9]
G. Barthe, T. Espitau, B. Grégoire, J. Hsu, L. Stefanesco, P.-Y. Strub.
Relational Reasoning via Probabilistic Coupling, in: Logic for Programming, Artificial Intelligence, and Reasoning - 20th International Conference, LPAR-20 2015, Suva, Fiji, 2015. [ DOI : 10.1007/978-3-662-48899-7_27 ]
https://hal.inria.fr/hal-01246719
[10]
G. Barthe, B. Grégoire, B. Schmidt.
Automated Proofs of Pairing-Based Cryptography, in: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, United States, October 2015. [ DOI : 10.1145/2810103.2813697 ]
https://hal.inria.fr/hal-01246713
[11]
S. Bernard, Y. Bertot, L. Rideau, P.-Y. Strub.
Formal Proofs of Transcendence for e and π as an Application of Multivariate and Symmetric Polynomials, in: Certified Programs and Proofs, St Petersburg, Florida, United States, J. Avigad, A. Chlipala (editors), ACM Press, January 2016, 12 p.
https://hal.inria.fr/hal-01240025
[12]
Y. Bertot.
Fixed Precision Patterns for the Formal Verification of Mathematical Constant Approximations, in: Certified Programs and Proofs (CPP'15), Mumbai, India, ACM, January 2015. [ DOI : 10.1145/2676724.2693172 ]
https://hal.inria.fr/hal-01074927
[13]
C. Cohen, B. Djalal.
Formalization of a Newton Series Representation of Polynomials, in: Certified Programs and Proofs, St Petersburg, Florida, United States, J. Avigad, A. Chlipala (editors), January 2016.
https://hal.inria.fr/hal-01240469
[14]
C. Dunchev, F. Guidi, C. Sacerdoti Coen, E. Tassi.
ELPI: fast, Embeddable, λProlog Interpreter, in: Proceedings of LPAR, Suva, Fiji, November 2015.
https://hal.inria.fr/hal-01176856
[15]
A. Faithfull, J. Bengtson, E. Tassi, C. Tankink.
Coqoon An IDE for interactive proof development in Coq, in: TACAS, Eindhoven, Netherlands, April 2016.
https://hal.inria.fr/hal-01242295

Internal Reports

[16]
G. Gonthier, A. Mahboubi, E. Tassi.
A Small Scale Reflection Extension for the Coq system, Inria Saclay Ile de France, 2015, no RR-6455.
https://hal.inria.fr/inria-00258384
[17]
J. Grimm.
Implementation of Bourbaki's Elements of Mathematics in Coq: Part Two; Ordered Sets, Cardinals, Integers, Inria Sophia Antipolis ; Inria, 2015, no RR-7150, 685 p.
https://hal.inria.fr/inria-00440786

Other Publications

[18]
Y. Bertot.
Semantics for programming languages with Coq encodings, March 2015, Lecture.
https://hal.inria.fr/cel-01130272
[19]
L. Théry.
Formally-Proven Kosaraju's algorithm, February 2015, working paper or preprint.
https://hal.archives-ouvertes.fr/hal-01095533