B. Blanchet, P. Cousot, R. Cousot, J. Feret, L. Mauborgne et al., A static analyzer for large safety-critical software, 2003.
DOI : 10.1145/781131.781153
URL : https://hal.archives-ouvertes.fr/hal-00128135

P. Cousot and R. Cousot, Abstract interpretation, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '77, 1977.
DOI : 10.1145/512950.512973
URL : https://hal.archives-ouvertes.fr/hal-01108790

X. Leroy, Formal verification of a realistic compiler, Communications of the ACM, vol.52, issue.7, 2009.
DOI : 10.1145/1538788.1538814
URL : https://hal.archives-ouvertes.fr/inria-00415861

P. Cousot and N. Halbwachs, Automatic discovery of linear restraints among variables of a program, Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '78, 1978.
DOI : 10.1145/512760.512770

R. Bagnara, P. M. Hill, and E. Zaffanella, The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems, Science of Computer Programming, vol.72, issue.1-2, pp.1-2, 2008.
DOI : 10.1016/j.scico.2007.08.001

B. Jeannet and A. Miné, Apron: A Library of Numerical Abstract Domains for Static Analysis, In: CAV, 2009.
DOI : 10.1007/978-3-642-02658-4_52
URL : https://hal.archives-ouvertes.fr/hal-00786354

F. Besson, T. Jensen, D. Pichardie, and T. Turpin, Result certification for relational program analysis, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00166930

A. Fouilhe, D. Monniaux, and M. Périn, Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra, In: SAS, vol.7935, 2013.
DOI : 10.1007/978-3-642-38856-9_19
URL : https://hal.archives-ouvertes.fr/hal-00806990

V. Laviron and F. Logozzo, SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities, LNCS, vol.5403, pp.229-244, 2009.
DOI : 10.1007/978-3-540-93900-9_20
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.146.4146

S. Sankaranarayanan, M. Colón, H. Sipma, and S. Manna, Efficient Strongly Relational Polyhedral Analysis, LNCS, vol.3855, pp.111-125, 2006.
DOI : 10.1007/11609773_8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.114.8322

A. Miné and X. Leroy, ZArith. http://forge.ocamlcore.org/projects/zarith 13. Pottier, F.: Syntactic soundness proof of a type-and-capability system with hidden state, JFP, vol.23, issue.1, 2013.

G. Claret, L. D. Gonzalez-huesca, Y. Régis-gianas, and B. Ziliani, Lightweight Proof by Reflection Using a Posteriori Simulation of Effectful Computation, 2013.
DOI : 10.1007/978-3-642-39634-2_8
URL : https://hal.archives-ouvertes.fr/hal-00870110

L. Birkedal, B. Reus, J. Schwinghammer, K. Støvring, J. Thamsborg et al., Step-indexed kripke models over recursive worlds, 2011.
DOI : 10.1145/1925844.1926401
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.190.2081

S. Blazy, V. Laporte, A. Maroneze, and D. Pichardie, Formal Verification of a C Value Analysis Based on Abstract Interpretation, Static Analysis Symposium (SAS), 2013.
DOI : 10.1007/978-3-642-38856-9_18
URL : https://hal.archives-ouvertes.fr/hal-00812515