W. Andrew, S. Appel, and . Blazy, Separation logic for small-step c-minor, TPHOLs, pp.5-21

[. Affeldt and N. Kobayashi, A Coq Library for Verification of Concurrent Programs, Electronic Notes in Theoretical Computer Science, vol.199, pp.17-32, 2008.
DOI : 10.1016/j.entcs.2007.11.010

[. Albert, G. Puebla, and M. V. Hermenegildo, Abstractioncarrying code, LPAR, pp.380-397, 2004.

. W. App01-]-andrew and . Appel, Foundational Proof-Carrying Code, IEEE Symposium on Logic in Computer Science, pp.247-258, 2001.

[. Barendregt, The Lambda Calculus : its Syntax and Semantics. Number 103 in Studies in Logic and the Foundations of Mathematics, pp.6-25, 1981.

[. Bjørner, A. Browne, and Z. Manna, Automatic generation of invariants and assertions, CP, pp.589-623, 1995.

Y. Bertot and P. Castéran, Interactive Theorem Proving and Program Development (Coq'Art : The Calculus of Inductive Construc- tions) Texts in Theoretical Computer Science, 2004.

[. Beyer, T. A. Henzinger, R. Jhala, and R. Majumdar, The software model checker Blast, International Journal on Software Tools for Technology Transfer, vol.2, issue.4, pp.505-525, 2007.
DOI : 10.1007/s10009-007-0044-z

[. Besson, T. P. Jensen, and D. Pichardie, Proof-carrying code from certified abstract interpretation and fixpoint compression, Theoretical Computer Science, vol.364, issue.3, pp.273-291, 2006.
DOI : 10.1016/j.tcs.2006.08.012
URL : http://doi.org/10.1016/j.tcs.2006.08.012

[. Bozga, Y. Lakhnech, and M. Périn, HERMES: An Automatic Tool for Verification of Secrecy in Security Protocols, CAV, pp.219-222, 2003.
DOI : 10.1007/978-3-540-45069-6_23

R. Aaron, Z. Bradley, and . Manna, Property-directed incremental invariant generation, Formal Asp. Comput, vol.20, issue.4-5, pp.379-405, 2008.

A. Bradley, Z. Manna, and H. B. Sipma, What's decidable about arrays ? In Verification, Model Checking, and Abstract Interpretation, LNCS, vol.3855, pp.427-442, 2006.

B. Bornat, Proving Pointer Programs in Hoare Logic, Conference on Mathematics of Program Construction, pp.102-126, 2000.
DOI : 10.1007/10722010_8

G. Balakrishnan, T. W. Reps, D. Melski, and T. Teitelbaum, WYSINWYX, VSTTE, pp.202-213, 2005.
DOI : 10.1145/1749608.1749612

J. Brouwer, Brouwer's Cambridge Lectures on Intuitionism, 1981.

P. Cousot and R. Cousot, Static Determination of Dynamic Properties of Programs, ISOP'76 : 2nd International Symposium on Programming, pp.106-130, 1976.

. Patrick, R. Cousot, and . Cousot, Abstract interpretation : a unified lattice model for static analysis of programs by construction or approximation of fixpoints, POPL'77 : 4th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.238-252, 1977.

P. Cousot and R. Cousot, Abstract Interpretation Frameworks, Journal of Logic and Computation, vol.2, issue.4, pp.511-547
DOI : 10.1093/logcom/2.4.511

R. Clarisó and J. Cortadella, The Octahedron Abstract Domain, SAS'04 : 11th International Symposium on Static Analysis, pp.312-327, 2004.
DOI : 10.1007/978-3-540-27864-1_23

P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné et al., The ASTRE?? Analyzer, ESOP, pp.21-30, 2005.
DOI : 10.1007/978-3-540-31987-0_3

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

P. Cousot, R. Cousot, J. Feret, A. Miné, L. Mauborgne et al., Varieties of Static Analyzers: A Comparison with ASTREE, First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (TASE '07), pp.3-20, 2007.
DOI : 10.1109/TASE.2007.55
URL : https://hal.archives-ouvertes.fr/hal-00154031

[. Canet, P. Cuoq, and B. Monate, A Value Analysis for C Programs, 2009 Ninth IEEE International Working Conference on Source Code Analysis and Manipulation, pp.123-124
DOI : 10.1109/SCAM.2009.22

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, pp.84-96, 1978.
DOI : 10.1145/512760.512770

[. Bibliographie, G. P. Coquand, and . Huet, The calculus of constructions, Inf. Comput, vol.76, issue.23, pp.95-120, 1988.

A. Chaieb, Proof-Producing Program Analysis, International Colloquium on Theoretical Aspects of Computing, pp.287-301, 2006.
DOI : 10.1007/11921240_20

A. Chlipala, Certified Programming with Dependent Types, Creative Commons, 2008.

[. Chomsky, On certain formal properties of grammars, Information and Control, vol.2, issue.2, pp.137-167
DOI : 10.1016/S0019-9958(59)90362-6

[. Calcagno, S. S. Ishtiaq, and P. W. Hearn, Semantic analysis of pointer aliasing, allocation and disposal in hoare logic351292, PPDP, pp.190-201, 2000.

[. Cachera, T. 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

E. M. Clarke, K. L. Mcmillan, S. Vale-aguiar-campos, and V. Hartonas-garmhausen, Symbolic model checking, Computer Aided Verification, pp.419-427, 1996.
DOI : 10.1007/3-540-61474-5_93

C. Chlipala, G. Malecha, G. Morrisett, A. Shinnar, and R. Wisnesky, Effective interactive proofs for higher-order imperative programs, ICFP '09 : Proceedings of the 14th ACM SIGPLAN international conference on Functional programming, pp.79-90, 2009.

A. Colmerauer, Une introductionàintroductionà prolog iii, FODO, pp.264-288, 1989.

P. Corbineau, Démonstration automatique en Théorie des Types, 2005.

D. Cachera and D. Pichardie, Programmation d'un interpréteur abstrait certifié en logique constructive, Technique et Science Informatiques (TSI), 2010.

P. Cuoq, J. Signoles, P. Baudin, R. Bonichon, G. Canet et al., Experience report : Ocaml for an industrial-strength static analysis framework, ICFP, pp.281-286, 2009.

[. Curry, Foundations of Mathematical Logic, 1963.

[. Dutertre and L. Mendonça-de-moura, A fast lineararithmetic solver for dpll(t), CAV, pp.81-94, 2006.

M. Detlefsen, Hilbert's Program : an Essay on Mathematical Instrumentalism . Number 182 in Synthese Library, Reidel, issue.1, 1986.
DOI : 10.1007/978-94-015-7731-1

[. Dijkstra, Guarded commands, nondeterminacy and formal derivation of programs, Communications of the ACM, vol.18, issue.8, pp.453-457, 1975.
DOI : 10.1145/360933.360975

W. Edsger and . Dijkstra, A Discipline of Programming, 1976.

L. David and . Dill, Timing assumptions and verification of finite-state concurrent systems, Automatic Verification Methods for Finite State Systems, pp.197-212, 1989.

L. Mendonça-de-moura, B. Dutertre, and N. Shankar, A tutorial on satisfiability modulo theories, CAV, pp.20-36, 2007.

. Jean-claude, H. Fernandez, A. Garavel, L. Kerbrat, R. Mounier et al., CADP -a protocol validation and verification toolbox, CAV, pp.437-440, 1996.

[. Filliâtre, Why : a multi-language multi-prover verification tool, Research Report, vol.1366, pp.43-54, 2003.

]. Flo67, . W. Robert, and . Floyd, Assigning meanings to programs, Symposia in Applied Mathematics, pp.19-32, 1967.

[. Filliâtre and C. Marché, Multi-prover Verification of C Programs, ICFEM, pp.15-29, 2004.
DOI : 10.1007/978-3-540-30482-1_10

[. Filliâtre and C. Marché, The Why/Krakatoa/Caduceus Platform for Deductive Program Verification, 19th International Conference on Computer Aided Verification, pp.43-44, 2007.
DOI : 10.1007/978-3-540-73368-3_21

J. Michael, M. O. Fischer, and . Rabin, Super-exponential complexity of Presburger arithmetic, Proceedings of the SIAM-AMS Symposium in Applied Mathematics, pp.27-41, 1974.

G. Frege, Translations from the Philosophical Writings of Gottlob Frege, Blackwell, issue.2, 1960.

G. Gentzen, Untersuchungen ???ber das logische Schlie???en. I, Mathematische Zeitschrift, vol.39, issue.1, pp.176-210
DOI : 10.1007/BF01201353

[. Gentzen, The Collected Papers of Gerhard Gentzen. Studies in Logic and the Foundations of Mathematics, 1969.

[. Girard, Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.1-102
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075966

B. Girard, Le point aveugle, cours de logique, tome 1 : vers la perfection. collection " Visions des Sciences, Editions Hermann, 2006.

[. Girard, Y. Lafont, and P. Taylor, Proofs and Types. Number 7 in Cambridge Tracts in Theoretical Computer Science Lifting abstract interpreters to quantified logical domains, Principles of Programming Languages, pp.235-246, 1989.

K. K. Gödel and . Gödel, Convincing proofs for program certification A framework for numeric analysis of array operations) [Hal93a] Nicolas Halbwachs. Synchronous programming of reactive systems An axiomatic basis for computer programming, International Workshop on Certification of Safety-Critical Software Controlled Systemscité page 170) [GRS05] Denis Gopan, Thomas W. Reps, and Shmuel Sagiv Principles of Programming Languagescité page 152) [Hal93b] Nicolas Halbwachs. A tutorial of lustre. 1993. (cité page 152) [HJMS03] Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, and Grégoire Sutre. Software verification with Blast. In SPIN Workshop on Model Checking Software, pp.338-350, 1969.

J. Gerard and . Holzmann, Software model checking with Spin Advances in Computers (cité page 7) [HP08] Nicolas Halbwachs and Mathias. Péron. Discovering properties about arrays in simple programs, ACM Conference on Programming Language Design and ImplementationPLDI'08), pp.78-109, 2005.

[. , R. Hoare, and N. Wirth, An axiomatic definition of the programming language pascal, Acta Informatica, vol.2, issue.8, pp.335-355, 1973.

C. Stephen and . Kleene, Introduction to Metamathematics, Bibliotheca Mathematica. North-Holland, vol.1, 1952.

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

[. Bibliographie, J. Kroening, S. A. Ouaknine, O. Seshia, and . Strichman, Abstraction-based satisfiability solving of presburger arithmetic, CAV, pp.308-320, 2004.

D. Kroening and O. Strichman, A framework for Satisfiability Modulo Theories, Formal Aspects of Computing, vol.35, issue.4, pp.485-494, 2009.
DOI : 10.1007/s00165-009-0105-z

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

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

A. Miné, The octagon abstract domain, AST'01, pp.310-319, 2001.

A. Miné, A Few Graph-Based Relational Numerical Abstract Domains, SAS'02 : 9th International Symposium on Static Analysis, pp.117-132, 2002.
DOI : 10.1007/3-540-45789-5_11

A. Miné, Weakly Relational Numerical Abstract Domains, 2004.

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

[. Moggi, Computational lambda-calculus and monads, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science, pp.14-23
DOI : 10.1109/LICS.1989.39155
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.2787

[. Monniaux, Réalisation mécanisée d'interpréteurs abstraits, French, pp.7-47, 1998.

[. Monniaux, On Using Floating-Point Computations to Help an Exact Linear Arithmetic Decision Procedure, Computer-aided verification (CAV), pp.570-583, 2009.
DOI : 10.1007/978-3-642-02658-4_42
URL : https://hal.archives-ouvertes.fr/hal-00354112

]. J. Mor82 and . Morris, A general axiom of assignment. assignment and linked data structures. a proof of the schorr-waite algorithm, Theoretical Foundations of Programming Methodology (Lecture Notes of the 1981 International Marktoberdorf Summer School), pp.25-51, 1982.

J. Mccarthy and J. A. Painter, Correctness of a compiler for arithmetic expressions, Symposium in Applied Mathematics, pp.33-41
DOI : 10.1090/psapm/019/0242403

]. Nam01, . S. Kedar, and . Namjoshi, Certifying model checkers, Computer Aided Verification, pp.2-13, 2001.

G. C. Necula, Proof-carrying code, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '97, pp.106-119, 1997.
DOI : 10.1145/263699.263712

C. George and . Necula, Translation validation for an optimizing compiler, PLDI, pp.83-95, 2000.

[. Nanevski, G. Morrisett, and L. Birkedal, Polymorphism and separation in hoare type theory, ICFP, pp.62-73, 2006.

[. Nanevski, J. G. Morrisett, and L. Birkedal, Hoare type theory, polymorphism and separation, Journal of Functional Programming, vol.1, issue.5-6, pp.865-911, 2008.
DOI : 10.1145/277650.277732

G. Nanevski, A. Morrisett, P. Shinnar, L. Govereau, and . Birkedal, Ynot : dependent types for imperative programs, ICFP, pp.229-240, 2008.

W. O. Peter and . Hearn, Resources, concurrency and local reasoning, In CONCUR, pp.49-67, 2004.

W. O. Peter, H. Hearn, and . Yang, A semantic basis for local reasoning, FoSSaCS, pp.402-416, 2002.

L. Paulson, Logic and Computation : Interactive proof with Cambridge LCF. Number 2 in Cambridge Tracts in Theoretical Computer Science, 1987.
DOI : 10.1017/CBO9780511526602

G. Peano, Arithmetices Principia, Nova Methodo Exposita, Fratres Bocca, pp.1889-1892

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

[. Paulin-mohring, Extracting F(omega)'s programs from proofs in the calculus, Principles of Programming Languages, pp.89-104, 1989.

[. Paulin-mohring, Extraction de programmes dans le Calcul des Constructions, Thèse d'université, pp.48-49, 1989.
URL : https://hal.archives-ouvertes.fr/tel-00431825

A. Pnueli, The temporal logic of programs, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), pp.46-57, 1977.
DOI : 10.1109/SFCS.1977.32

[. Pop, La représentation SSA : sémantique, analyses et implémentation dans GCC, 2006.

[. Prawitz, Natural Deduction : a Proof-Theoretical Study. Number 3 in Stockholm Studies in Philosophy, pp.3-15, 1965.

R. Vaughan and . Pratt, Two easy theories whose combination is hard, 1977.

D. Prawitz, Meaning and proofs: on the conflict between classical and intuitionistic logic, Theoria, vol.43, issue.1, pp.2-40, 1977.
DOI : 10.1111/j.1755-2567.1977.tb00776.x

A. Pnueli, M. Siegel, and E. Singerman, Translation validation, TACAS, pp.151-166, 1998.
DOI : 10.1007/BFb0054170

P. Raymond, Synchronous program verification with Lustre/Lesar In Modeling and Verification of Real-Time Systems, chapter 6, pp.7-169, 2008.

C. John and . Reynolds, Separation logic : A logic for shared mutable data structures, LICS, pp.55-74, 2002.

G. Henry and . Rice, Classes of Recursively Enumerable Sets and Their Decision Problems, Transactions of the American Mathematical Society, vol.74, issue.1953, pp.358-366

[. Russell, The Principles of Mathematics, 1903.

[. Russell, Mathematical Logic as Based on the Theory of Types, American Journal of Mathematics, vol.30, issue.3, pp.222-262, 1908.
DOI : 10.2307/2369948

J. A. , R. , and A. Voronkov, Handbook of Automated Reasoning, 2001.

N. Scaife and P. Caspi, Integrating model-based design and preemptive scheduling in mixed time-and event-triggered systems, Proceedings. 16th Euromicro Conference on Real-Time Systems, 2004. ECRTS 2004., pp.119-126, 2004.
DOI : 10.1109/EMRTS.2004.1311013

J. Sifakis, Global and local invariants in transition systems, ICALP, pp.510-522, 1982.

[. Sifakis and J. Queille, Specification and verification of concurrent systems in CESAR, Proceedings of the International Symposium on Programming, pp.6-169, 1982.

[. Sofronis, S. Tripakis, and P. Caspi, A memory-optimal buffering protocol for preservation of synchronous semantics under preemptive scheduling, Proceedings of the 6th ACM & IEEE International conference on Embedded software , EMSOFT '06, pp.21-33, 2006.
DOI : 10.1145/1176887.1176892

S. Seo, H. Yang, and K. Yi, Automatic construction of hoare proofs from abstract interpretation results In Asian Programming Languages and Systems Symposium, APLAS'03). (cité pages 50, pp.230-245, 2003.

S. Seo, H. Yang, K. Yi, and T. Han, Goaldirected weakening of abstract interpretation results, ACM Trans. Program . Lang. Syst, vol.29, issue.6, pp.2007-176

[. Tennent, Semantics of Programming Languages. International Series in Computer Science, 1991.

A. Sjerp and T. , Principles of Intuitionism. Number 95 in Lecture Notes in Mathematics, 1969.

[. Tripakis, C. Sofronis, N. Scaife, and P. Caspi, Semantics-preserving and memory-efficient implementation of inter-task Bibliographie communication on static-priority or edf schedulers, EMSOFT, pp.353-360, 2005.

A. Mathison and T. , On computable numbers, with an application to the entscheidungsproblem This is the paper that introduced what is now called the Universal Turing Machine, Proceedings of the London Mathematical Society. Second Series, pp.230-265, 1936.