J. Spivey, An introduction to Z and formal specifications, Software Engineering Journal, vol.4, issue.1
DOI : 10.1049/sej.1989.0006
URL : http://undergraduate.csse.uwa.edu.au/units/CITS5501/Lectures/FMZHandout.pdf

K. M. Leino, Dafny: An Automatic Program Verifier for Functional Correctness, Proceedings of the 16th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR'10, pp.348-370, 2010.
DOI : 10.1007/978-3-540-87873-5_10
URL : http://research.microsoft.com/~leino/papers/krml203.pdf

K. M. Leino, Specification and verification of object-oriented software, Marktoberdorf International Summer School, 2008.

F. Bobot, J. Filliâtre, C. Marché, and A. Paskevich, Why3: Shepherd your herd of provers, Boogie 2011: First International Workshop on Intermediate Verification Languages, pp.53-64, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00790310

I. Team, The Isabelle/Isar reference manual, 2015.

L. Paulson, The foundation of a generic theorem prover, Journal of Automated Reasoning, vol.49, issue.3, 1988.
DOI : 10.1007/BF00248324
URL : http://arxiv.org/pdf/cs/9301105

T. Nipkow, L. Paulson, and M. Wenzel, Isabelle/HOL ? A Proof Assistant for Higher- Order Logic, LNCS, vol.2283, 2002.

R. L. Constable, T. Knoblock, and J. L. Bates, Writing programs that construct proofs, Journal of Automated Reasoning, vol.1, issue.3, pp.285-326, 1984.
DOI : 10.1007/BF00244273
URL : http://ecommons.cornell.edu/bitstream/1813/6484/1/84-645.pdf

S. Owre, J. Rushby, N. Shankar, and D. Stringer-calvert, PVS: An Experience Report, Lecture Notes in Computer Science, vol.1641, pp.338-345, 1998.
DOI : 10.1007/3-540-48257-1_24

N. Owre and . Shankar, Writing PVS proof strategies Design and Application of Strategies, Higher Order Logics CP-2003-212448 in NASA Conference Publication, pp.1-15, 2003.

C. Team, The Coq proof assistant reference manual, LogiCal Project, version 8, 2015.

S. Blazy and X. Leroy, Formal Verification of a Memory Model for C-Like Imperative Languages, International Conference on Formal Engineering Methods (ICFEM 2005), pp.280-299, 2005.
DOI : 10.1007/11576280_20
URL : https://hal.archives-ouvertes.fr/inria-00077921

S. Blazy, Z. Dargaye, and X. Leroy, Formal Verification of a C Compiler Front-End, Int. Symp. on Formal Methods Lecture Notes in Computer Science, vol.4085, pp.460-475, 2006.
DOI : 10.1007/11813040_31
URL : https://hal.archives-ouvertes.fr/inria-00106401

X. Leroy, Formal certification of a compiler back-end, or: programming a compiler with a proof assistant, 33rd ACM symposium on Principles of Programming Languages, pp.42-54, 2006.
DOI : 10.1145/1111320.1111042
URL : https://hal.archives-ouvertes.fr/inria-00000963

J. Etienne, M. Maarek, F. Anseaume, and V. Delebarre, Improving Predictability, Efficiency and Trust of Model-Based Proof Activity, 2015 IEEE/ACM 37th IEEE International Conference on Software Engineering, pp.139-148, 2015.
DOI : 10.1109/ICSE.2015.142

L. Habib, M. Jaume, and C. Morisset, Formal definition and comparison of access control models, Journal of Information Assurance and Security (JIAS), vol.4, issue.4, pp.372-381, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01195856

]. D. Delahaye, J. Etienne, and V. Viguié, Certifying Airport Security Regulations Using the Focal Environment, LNCS, vol.4085, pp.6-48, 2006.
DOI : 10.1007/11813040_4
URL : https://hal.archives-ouvertes.fr/hal-01125368

V. Prevosto, Conception et implantation du langage FoC pour le développement de logiciels certifiés, 2003.

P. Ayrault, T. Hardin, and F. Pessaux, Development of a Generic Voter under FoCal, TAP'09, pp.10-26, 2009.
DOI : 10.1017/CBO9780511624162
URL : https://hal.archives-ouvertes.fr/hal-01241361

L. Lamport, How to write a proof, Digital Equipment Corporation, 1993.
DOI : 10.2307/2974556

P. Ayrault, T. Hardin, and F. Pessaux, Development Life-cycle of Critical Software Under FoCaL, Electronic Notes in Theoretical Computer Science, vol.243, pp.15-31, 2009.
DOI : 10.1016/j.entcs.2009.07.003
URL : https://hal.archives-ouvertes.fr/hal-01195843

V. Prevosto and M. Jaume, Making proofs in a hierarchy of mathematical structures, Proceedings of the 11 th Calculemus Symposium, 2003.
URL : https://hal.archives-ouvertes.fr/hal-01531083

V. Prevosto and D. Doligez, Algorithms and proof inheritance in the Foc language, Journal of Automated Reasoning, vol.29, issue.3/4, pp.337-363, 2002.
DOI : 10.1023/A:1021979218446

S. Boulmé, Spécification d'un environnement dédiédédié`dédiéà la programmation certifiée de bibliothèques de calcul formel, Thèse de doctorat, 2000.

L. Damas and R. Milner, Principal type-schemes for functional programs, Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '82, pp.207-212, 1982.
DOI : 10.1145/582153.582176
URL : http://web.cs.wpi.edu/~cs4536/c12/milner-damas_principal_types.pdf

R. Milner, A theory of type polymorphism in programming, Journal of Computer and System Sciences, vol.17, issue.3, pp.348-375, 1978.
DOI : 10.1016/0022-0000(78)90014-4

M. Tofte, Operational semantics and polymorphic type inference, Thèse de doctorat CST-52-88, 1988.

J. Robinson, A Machine-Oriented Logic Based on the Resolution Principle, Journal of the ACM, vol.12, issue.1, pp.23-41, 1965.
DOI : 10.1145/321250.321253

C. Dubois and F. Pessaux, Termination Proofs in FOCALIZE, Draft Proceedings of the 2015 Symposium on Trends in Functional Programming, 2015.
DOI : 10.1007/978-3-319-39110-6_8

V. Prevosto and S. Boulmé, Proof Contexts with Late Binding, Typed Lambda Calculi and Applications, 7th International Conference, pp.324-338, 2005.
DOI : 10.1007/11417170_24
URL : http://focal.inria.fr/site/images/stories/articles/prevostotlca05.pdf

M. Boespflug, Design and implementation of a proof verifying kernel for the ??calculus modulo, 2011.
URL : https://hal.archives-ouvertes.fr/tel-00672699

M. Boespflug, Q. Carbonneaux, and O. Hermant, The lambda-pi-calculus modulo as a universal proof language, Proceedings of the Second International Workshop on Proof Exchange for Theorem Proving, 2012.

R. Cauderlier and P. Halmagrand, Checking Zenon Modulo Proofs in Dedukti, Fourth Workshop on Proof eXchange for Theorem Proving (PxTP), 2015.
DOI : 10.1007/978-3-642-25379-9_6
URL : https://hal.archives-ouvertes.fr/hal-01171360

M. Clochard, J. Filliâtre, and A. Paskevich, How to Avoid Proving the Absence of Integer Overflows, 7th Working Conference on Verified Software: Theories, Tools, and Experiments, 7th Working Conference on Verified Software: Theories, Tools, and Experiments, 2015.
DOI : 10.1007/978-3-319-08867-9_1
URL : https://hal.archives-ouvertes.fr/hal-01162661

M. Barnett, B. E. Chang, R. Deline, B. Jacobs, and K. R. Leino, Boogie: A Modular Reusable Verifier for Object-Oriented Programs, Proceedings of the 4th International Conference on Formal Methods for Components and Objects, FMCO'05, pp.364-38710, 2006.
DOI : 10.1007/11804192_17
URL : http://research.microsoft.com/~leino/papers/krml160.pdf

K. R. Leino, This is boogie 2, 2008.

L. De-moura and N. Bjørner, Z3: An efficient smt solver, in: Proceedings of the Theory and Practice of Software, 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS'08/ETAPS'08, pp.337-340, 2008.

D. Leijen and K. , Koka: Programming with Row Polymorphic Effect Types, Electronic Proceedings in Theoretical Computer Science, vol.153, 2013.
DOI : 10.4204/EPTCS.153.8
URL : http://arxiv.org/pdf/1406.2061

A. Chlipala, A certified type-preserving compiler from lambda calculus to assembly language, Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation, pp.54-65, 2007.
DOI : 10.1145/1250734.1250742
URL : http://www.cs.berkeley.edu/~adamc/papers/CtpcPLDI07/CtpcPLDI07.pdf

X. Leroy, A Formally Verified Compiler Back-end, Journal of Automated Reasoning, vol.27, issue.1, pp.363-44610, 2009.
DOI : 10.1007/978-3-642-59495-3
URL : https://hal.archives-ouvertes.fr/inria-00360768