Bibliography

• 1G. Barthe, B. Grégoire, S. Zanella Béguelin.
  
  Formal Certification of Code-Based Cryptographic Proofs, in: 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2009, ACM, 2009, p. 90–101.
  
  http://dx.doi.org/10.1145/1480881.1480894
• 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, p. 12–16.
  
  http://hal.inria.fr/inria-00331193/
• 4G. 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, p. 86-101.
  
  http://hal.inria.fr/inria-00139131

Articles in International Peer-Reviewed Journals

• 5B. Grégoire.
  
  Recent Advances in the Formal Verification of Cryptographic Systems: Turing's Legacy, in: ERCIM News, 2012, vol. 2012, n^o 91.
  
  http://hal.inria.fr/hal-00765897

Invited Conferences

• 6G. Barthe, B. Grégoire, S. Zanella Béguelin.
  
  Probabilistic relational Hoare logics for computer-aided security proofs, in: Mathematics of Program Construction - 11th International Conference, MPC 2012, Madrid, Spain, 2012. [ DOI : 10.1007/978-3-642-31113-0_1 ]
  
  http://hal.inria.fr/hal-00765864

International Conferences with Proceedings

• 7M. Backes, G. Barthe, M. Berg, B. Grégoire, C. Kunz, M. Skoruppa, S. Zanella Béguelin.
  
  Verified Security of Merkle-Damgaard, in: 25th IEEE Computer Security Foundations Symposium, CSF 2012, Cambridge, MA, United States, 2012. [ DOI : 10.1109/CSF.2012.14 ]
  
  http://hal.inria.fr/hal-00765883
• 8G. Barthe, B. Grégoire, S. Heraud, F. Olmedo, S. Zanella Béguelin.
  
  Verified Indifferentiable Hashing into Elliptic Curves, in: Principles of Security and Trust - First International Conference, POST 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, 2012. [ DOI : 10.1007/978-3-642-28641-4_12 ]
  
  http://hal.inria.fr/hal-00765874
• 9N. Brisebarre, M. Joldes, É. Martin-Dorel, M. Mayero, J.-M. Muller, I. Paşca, L. Rideau, L. Théry.
  
  Rigorous Polynomial Approximation using Taylor Models in Coq, in: Fourth NASA Formal Methods Symposium, Norfolk, Virginia, United States, A. Goodloe, S. Person (editors), Lecture Notes in Computer Science, Springer, April 2012, 15 p.
  
  http://hal.inria.fr/ensl-00653460
• 10M. Dénès, A. Mörtberg, V. Siles.
  
  A refinement-based approach to computational algebra in COQ, in: ITP - 3rd International Conference on Interactive Theorem Proving - 2012, Princeton, United States, L. Beringer, A. Felty (editors), Lecture Notes In Computer Science, Springer, 2012, vol. 7406, p. 83-98. [ DOI : 10.1007/978-3-642-32347-8_7 ]
  
  http://hal.inria.fr/hal-00734505
• 11J. Heras, M. Dénès, G. Mata, A. Mörtberg, M. Poza, V. Siles.
  
  Towards a certified computation of homology groups for digital images, in: CTIC - Computational Topology in Image Context - 2012, Bertinoro, Italy, Lecture Notes In Computer Science, Springer, 2012, vol. 7309, p. 49-57. [ DOI : 10.1007/978-3-642-30238-1_6 ]
  
  http://hal.inria.fr/hal-00711385

Internal Reports

• 12L. Rideau, B. Serpette, C. Tedeschi.
  
  Formalization and Concretization of Ordered Networks, Inria, December 2012, n^o RR-8172, 22 p.
  
  http://hal.inria.fr/hal-00762627