A. W. Appel, Program Logics for Certified Compilers, 2014.
DOI : 10.1017/CBO9781107256552

A. W. Appel and S. Blazy, Separation Logic for Small-Step cminor, TPHOLs, pp.5-21, 2007.
DOI : 10.1007/978-3-540-74591-4_3
URL : https://hal.archives-ouvertes.fr/inria-00165915

A. W. Appel and D. A. Mcallester, An indexed model of recursive types for foundational proof-carrying code, ACM Transactions on Programming Languages and Systems, vol.23, issue.5, pp.657-683, 2001.
DOI : 10.1145/504709.504712

Y. Bertot, Structural Abstract Interpretation: A Formal Study Using Coq, Language Engineering and Rigorous Software Development, pp.153-194, 2008.
DOI : 10.1007/978-3-540-31987-0_3
URL : https://hal.archives-ouvertes.fr/inria-00329572

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

S. Blazy, Z. Dargaye, and X. Leroy, Formal Verification of a C Compiler Front-End, Formal Methods, pp.460-475, 2006.
DOI : 10.1007/11813040_31
URL : https://hal.archives-ouvertes.fr/inria-00106401

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

S. Boldo and G. Melquiond, Flocq: A Unified Library for Proving Floating-Point Algorithms in Coq, 2011 IEEE 20th Symposium on Computer Arithmetic, pp.243-252, 2011.
DOI : 10.1109/ARITH.2011.40
URL : https://hal.archives-ouvertes.fr/inria-00534854

T. Braibant, J. Jourdan, and D. Monniaux, Implementing and Reasoning About Hash-consed Data Structures in Coq, Journal of Automated Reasoning, vol.53, issue.3, pp.271-304, 2014.
DOI : 10.1007/s10817-014-9306-0
URL : https://hal.archives-ouvertes.fr/hal-00881085

D. Cachera, T. P. Jensen, D. Pichardie, and V. Rusu, Extracting a data flow analyser in constructive logic, Theoretical Computer Science, vol.342, issue.1, pp.56-78, 2005.
DOI : 10.1016/j.tcs.2005.06.004
URL : https://hal.archives-ouvertes.fr/inria-00564633

A. Chlipala, Modular development of certified program verifiers with a proof assistant, J. Funct. Program, vol.18, pp.5-6599, 2008.

. Berry, A verified validator for an industrial-strength static analyzer, 2013.

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

P. Cousot and R. Cousot, Systematic design of program analysis frameworks, Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '79, pp.269-282, 1979.
DOI : 10.1145/567752.567778

P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné et al., Why does Astrée scale up? Formal Methods in System Design, pp.229-264, 2009.

]. P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné et al., Combination of Abstractions in the ASTR??E Static Analyzer, ASIAN, pp.272-300, 2006.
DOI : 10.1007/978-3-540-24725-8_2

A. Fouilhé, D. Monniaux, and M. Périn, Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra, SAS, pp.345-365, 2013.
DOI : 10.1007/978-3-642-38856-9_19

A. Fouilhé and S. Boulmé, A Certifying Frontend for (Sub)polyhedral Abstract Domains, VSTTE, pp.200-215, 2014.
DOI : 10.1007/978-3-319-12154-3_13

D. Greenaway, J. Andronick, and G. Klein, Bridging the Gap: Automatic Verified Abstraction of C, ITP, pp.99-115, 2012.
DOI : 10.1007/978-3-642-32347-8_8

S. Gulwani, A. Tiwari, and G. C. Necula, Join Algorithms for the Theory of Uninterpreted Functions, FSTTCS, pp.311-323, 2004.
DOI : 10.1007/978-3-540-30538-5_26

N. Halbwachs and M. Péron, Discovering properties about arrays in simple programs, PLDI, pp.339-348, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00288274

P. Herms, C. Marché, and B. Monate, A Certified Multi-prover Verification Condition Generator, VSTTE, pp.2-17, 2012.
DOI : 10.1007/3-540-48118-4_45
URL : https://hal.archives-ouvertes.fr/hal-00639977

M. Hofmann, A. Karbyshev, and H. Seidl, Verifying a Local Generic Solver in Coq, SAS, pp.340-355, 2010.
DOI : 10.1007/978-3-642-15769-1_21

G. Klein and T. Nipkow, A machine-checked model for a Java-like language, virtual machine, and compiler, ACM Transactions on Programming Languages and Systems, vol.28, issue.4, pp.619-695, 2006.
DOI : 10.1145/1146809.1146811

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

X. Leroy, A Formally Verified Compiler Back-end, Journal of Automated Reasoning, vol.27, issue.1, pp.363-446, 2009.
DOI : 10.1007/s10817-009-9155-4
URL : https://hal.archives-ouvertes.fr/inria-00360768

A. Miné, The octagon abstract domain. Higher-Order and Symbolic Computation, pp.31-100, 2006.

A. Miné, Symbolic Methods to Enhance the Precision of Numerical Abstract Domains, VMCAI, pp.348-363, 2006.
DOI : 10.1007/11609773_23

D. Monniaux, Réalisation mécanisée d'interpréteurs abstraits, 1998.

J. A. Navas, P. Schachte, H. Søndergaard, and P. J. Stuckey, Signedness-Agnostic Program Analysis: Precise Integer Bounds for Low-Level Code, APLAS, pp.115-130, 2012.
DOI : 10.1007/978-3-642-35182-2_9

F. Nielson, H. Nielson, and C. Hankin, Principles of Program Analysis, 2005.
DOI : 10.1007/978-3-662-03811-6

T. Nipkow, Abstract Interpretation of Annotated Commands, ITP, pp.116-132, 2012.
DOI : 10.1007/978-3-642-32347-8_9

D. Pichardie, Interprétation abstraite en logique intuitionniste: extraction d'analyseurs Java certifiés, 2005.

D. Pichardie, Building Certified Static Analysers by Modular Construction of Well-founded Lattices, Electronic Notes in Theoretical Computer Science, vol.212, pp.225-239, 2008.
DOI : 10.1016/j.entcs.2008.04.064
URL : https://hal.archives-ouvertes.fr/inria-00332365

T. W. Reps, G. Balakrishnan, and J. Lim, Intermediate-representation recovery from low-level code, Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation , PEPM '06, pp.100-111, 2006.
DOI : 10.1145/1111542.1111560

X. Rival and L. Mauborgne, The trace partitioning abstract domain, ACM Transactions on Programming Languages and Systems, vol.29, issue.5, 2007.
DOI : 10.1145/1275497.1275501