A. J. Ahmed, A. W. Appel, and R. Virga, A stratified semantics of general references embeddable in higherorder logic, Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science, LICS'02, pp.75-86, 2002.

T. Ahrendt, B. Baar, M. Beckert, E. Giese, R. Habermalz et al., The KeY approach: Integrating object oriented design and formal verification, Proceedings of the European Workshop on Logics in Artificial Intelligence, JELIA'00, pp.21-36, 1919.

G. Audemard, P. Bertoli, A. Cimatti, A. Korni?owicz, and R. Sebastiani, A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions, Proceedings of the 18th International Conference on Automated Deduction, CADE'02, pp.195-210, 2002.
DOI : 10.1007/3-540-45620-1_17

E. Albert, R. Bubel, S. Genaim, R. Hähnle, G. Puebla et al., Verified resource guarantees using COSTA and KeY, Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation, PERM '11, pp.73-76, 2011.
DOI : 10.1145/1929501.1929513

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.186.2576

A. Armando, C. Castellini, and E. Giunchiglia, SAT-Based Procedures for Temporal Reasoning, Recent Advances in AI Planning Proceedings of the 5th European Conference on Planning, ECP'99 Studies in Logic and the Foundations of Mathematics, pp.97-108, 1954.
DOI : 10.1007/10720246_8

W. Andrew, A. P. Appel, and . Felty, A semantic model of types and machine instructions for proof-carrying code, Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, POPL'00, pp.243-253, 2000.

G. Armand, B. Faure, C. Grégoire, L. Keller, B. Théry et al., A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses, Proceedings of the First International Conference on Certified Programs and Proofs, pp.135-150, 2011.
DOI : 10.1145/1217856.1217859

URL : https://hal.archives-ouvertes.fr/hal-00639130

D. Aspinall, S. Gilmore, M. Hofmann, D. Sannella, and I. Stark, Mobile Resource Guarantees for Smart Devices, Proceedings of the 2004 International Workshop on Construction and Analysis of Safe, Secure, and Interoperable Smart Devices, CASSIS'04, pp.1-26, 2005.
DOI : 10.1007/978-3-540-30569-9_1

B. Armand, A. Grégoire, L. Spiwack, and . Théry, Extending Coq with Imperative Features and Its Application to SAT Verification, Proceedings of the First International Conference on Interactive Theorem Proving, pp.83-98, 2010.
DOI : 10.1007/978-3-642-14052-5_8

URL : https://hal.archives-ouvertes.fr/inria-00502496

W. Andrew, D. Appel, G. Albert, M. Puebla, and . Hermenegildo, An indexed model of recursive types for foundational proof-carrying code Abstraction-carrying code, Proceedings of the 11th International Conference , Logic for Programming, Artificial Intelligence, and Reasoning, LPAR'05, pp.657-683, 2001.

A. W. Appel, Foundational proof-carrying code, Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, LICS 2001, pp.247-256, 2001.
DOI : 10.1109/lics.2001.932501

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.2076

[. Barendregt and E. Barendsen, Autarkic computations in formal proofs, Journal of Automated Reasoning, vol.28, issue.3, pp.321-336, 2002.
DOI : 10.1023/A:1015761529444

M. Bozzano, R. Bruttomesso, A. Cimatti, T. Junttila, S. Ranise et al., Efficient Satisfiability Modulo Theories via Delayed Theory Combination, Proceedings of the 17th International Conference on Computer Aided Verification, CAV'05, pp.335-349, 2005.
DOI : 10.1007/11513988_34

[. Blanchette, L. Bulwahn, and T. Nipkow, Automatic Proof and Disproof in Isabelle/HOL, Proceedings of the 8th International Symposium on Frontiers of Combining Systems, pp.12-27, 2011.
DOI : 10.1007/BFb0028402

[. Blanchette, S. Böhme, and L. C. Paulson, Extending Sledgehammer with SMT Solvers, Proceedings of the 23rd International Conference on Automated Deduction, pp.116-130, 2011.
DOI : 10.1007/BFb0028402

Y. Bertot and P. Castéran, Interactive Theorem Proving and Program Development. Coq'Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00344237

B. Barnett, R. Chang, B. Deline, K. Jacobs, M. Rustan et al., 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-387, 2005.
DOI : 10.1007/11804192_17

R. Bruttomesso, A. Cimatti, A. Franzén, A. Griggio, and R. Sebastiani, Delayed Theory Combination vs. Nelson-Oppen for Satisfiability Modulo Theories: A Comparative Analysis, Proceedings of the 13th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR'06, pp.527-541, 2006.
DOI : 10.1007/11916277_36

[. Besson, P. Cornilleau, and T. Jensen, Why3 and Coq source of the development, 2012.

[. Besson, P. Cornilleau, and D. Pichardie, Modular SMT Proofs for Fast Reflexive Checking Inside Coq, Proceedings of the First International Conference on Certified Programs and Proofs, pp.151-166, 2011.
DOI : 10.1016/j.jal.2007.07.003

URL : https://hal.archives-ouvertes.fr/hal-00646960

[. Boespflug, M. Dénès, and B. Grégoire, Full Reduction at Full Throttle, Proceedings of the First International Conference on Certified Programs and Proofs, pp.362-377, 2011.
DOI : 10.1007/3-540-44464-5_13

URL : https://hal.archives-ouvertes.fr/hal-00650940

[. Besson, Fast Reflexive Arithmetic Tactics the Linear Case and Beyond, Proc. of TYPES, pp.48-62, 2006.
DOI : 10.1007/978-3-540-74464-1_4

J. Bobot, C. Filliâtre, G. Marché, A. Melquiond, and . Paskevich, The Why3 platform (version 0.80), 2012.

[. 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

[. Böhme, C. J. Anthony, T. Fox, T. Sewell, and . Weber, Reconstruction of Z3???s Bit-Vector Proofs in HOL4 and Isabelle/HOL, Proceedings of the First International Conference on Certified Programs and Proofs, pp.183-198, 2011.
DOI : 10.1016/j.jal.2007.07.003

A. Biere, PicoSAT essentials, Journal on Satisfiability Boolean Modeling and Computation (JSAT), vol.4, issue.2-4, pp.75-97, 2008.

[. Besson, T. Jensen, D. Pichardie, and T. Turpin, Certified Result Checking for Polyhedral Analysis of Bytecode Programs, Proceedings of the 5th Symposium on Trustworthly Global Computing, pp.253-267, 2010.
DOI : 10.1007/978-3-642-15640-3_17

URL : https://hal.archives-ouvertes.fr/inria-00537816

[. Barnett, K. Rustan, M. Leino, and W. Schulte, The Spec# Programming System: An Overview, Proceedings of the 2004 International Workshop on Construction and Analysis of Safe, Secure and Interoperable Smart devices, CASSIS'04, pp.49-69, 2004.
DOI : 10.1007/978-3-540-30569-9_3

[. Borgida, J. Mylopoulos, and R. Reiter, On the frame problem in procedure specifications, IEEE Transactions on Software Engineering, vol.21, issue.10, pp.785-798, 1995.
DOI : 10.1109/32.469460

S. Böhme and T. Nipkow, Sledgehammer: Judgement Day, Proceedings of the 5th International Joint Conference on Automated Reasoning , IJCAR'10, pp.107-121, 2010.
DOI : 10.1007/978-3-642-14203-1_9

[. Bouton, D. Caminha, B. De-oliveira, D. Déharbe, and P. Fontaine, veriT: An Open, Trustable and Efficient SMT-Solver, Proceedings of the 22nd International Conference on Automated Deduction, CADE'09, lecture Notes in Computer Science, pp.151-156, 2009.
DOI : 10.1007/978-3-540-73595-3_38

URL : https://hal.archives-ouvertes.fr/inria-00430634

[. Boulton, Efficiency in a Fully-Expansive Theorem Prover, 1994.

[. Bobot and A. Paskevich, Expressing Polymorphic Types in a Many-Sorted Language, Proceedings of the 8th International Symposium on Frontiers of Combining Systems, pp.87-102, 2011.
DOI : 10.1007/978-3-540-78800-3_24

URL : https://hal.archives-ouvertes.fr/inria-00591414

S. Böhme and T. Weber, Fast LCF-Style Proof Reconstruction for Z3, Proceedings of the First International Conference on Interactive Theorem Proving, pp.179-194, 2010.
DOI : 10.1007/978-3-642-14052-5_14

P. Cousot and R. Cousot, Static determination of dynamic properties of programs, Proceedings of the Second International Symposium on Programming, pp.106-130

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/inria-00528590

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
DOI : 10.1145/567752.567778

P. Cousot and R. Cousot, Comparing the Galois connection and widening/narrowing approaches to abstract interpretation, Proceedings of the 4th International Workshop Programming Language Implementation and Logic Programming, PLILP'92, pp.269-295, 1992.
DOI : 10.1007/3-540-55844-6_142

P. Cousot and R. Cousot, Inductive definitions, semantics and abstract interpretations, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '92, pp.83-94, 1992.
DOI : 10.1145/143165.143184

E. Contejean and P. Corbineau, Reflecting Proofs in First-Order Logic with Equality, Proceedings of the 20th International Conference on Automated Deduction, CADE'05, pp.7-22, 2005.
DOI : 10.1007/11532231_2

URL : https://hal.archives-ouvertes.fr/hal-00946061

E. Sylvain-conchon, J. Contejean, and . Kanig, Ergo : a theorem prover for polymorphic first-order logic modulo theories, 2006.

E. Sylvain-conchon, J. Contejean, S. Kanig, and . Lescuyer, Lightweight integration of the ergo theorem prover inside a proof assistant, Proceedings of the second workshop on Automated formal methods, AFM '07, pp.55-59, 2007.

[. Chang, A. Chlipala, G. C. Necula, and R. R. Schneck, The open verifier framework for foundational verifiers, Proceedings of the 2005 ACM SIGPLAN international workshop on Types in languages design and implementation , TLDI '05, pp.1-12, 2005.
DOI : 10.1145/1040294.1040295

E. Cohen, M. Dahlweid, M. Hillebrand, D. Leinenbach, M. Moskal et al., VCC: A Practical System for Verifying Concurrent C, Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics, TPHOLs'09, pp.23-42, 2009.
DOI : 10.1007/978-3-540-74591-4_15

J. Sylvain-conchon and . Filliâtre, Semi-persistent Data Structures, Proceedings of 17th European Symposium on Programming, ESOP'08, pp.322-336, 2008.
DOI : 10.1007/978-3-540-78739-6_25

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
DOI : 10.1145/512760.512770

]. N. Che68 and . Chernikoba, Algorithm for discovering the set of all the solutions of a linear programming problem, USSR Computational Mathematics and Mathematical Physics, vol.8, issue.6, pp.282-293, 1968.

[. 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

C. Colby, P. Lee, G. C. Necula, F. Blau, M. Plesko et al., A certifying compiler for Java, Proceedings of the ACM SIG- PLAN 2000 conference on Programming language design and implementation, PLDI'00, pp.95-107, 2000.

[. Cohen, M. Moskal, S. Tobies, and W. Schulte, A Precise Yet Efficient Memory Model For C, Proceedings of the 4th International Workshop on Systems Software Verification , SSV'09, pp.85-103, 2009.
DOI : 10.1016/j.entcs.2009.09.061

R. Cartwright and D. C. Oppen, The logic of aliasing, Acta Informatica, vol.15, issue.4, pp.365-384, 1981.
DOI : 10.1007/BF00264535

K. Crary, Toward a foundational typed assembly language, Conference Record of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, POPL'03, pp.198-212, 2003.

[. Dutertre and L. M. De-moura, The Yices SMT solver, 2006.

W. Edsger and . Dijkstra, Guarded commands, nondeterminacy and formal derivation of programs, Communications of the ACM, vol.18, issue.8, pp.453-457, 1975.

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

[. Davis, G. Logemann, and D. Loveland, A machine program for theorem-proving, Communications of the ACM, vol.5, issue.7, pp.394-397, 1962.
DOI : 10.1145/368273.368557

N. Leonardo-de-moura and . Bjørner, Model-based Theory Combination, Electronic Notes in Theoretical Computer Science, vol.198, issue.2, pp.37-49, 2008.
DOI : 10.1016/j.entcs.2008.04.079

M. Leonardo, N. De-moura, and . Bjørner, Proofs and refutations , and Z3, Proceedings of the LPAR 2008 Workshops, Knowledge Exchange: Automated Provers and Proof Assistants, and the 7th International Workshop on the Implementation of Logics, 2008.

M. Leonardo, N. De-moura, and . Bjørner, Z3: An efficient SMT solver, Proceedings of the 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS'08, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS'08, pp.337-340, 2008.

M. Leonardo, H. De-moura, and . Rueß, Lemmas on demand for satisfiability solvers, Theory and Applications of Satisfiability Testing, pp.1-8, 2002.

M. Leonardo, H. De-moura, N. Rueß, and . Shankar, Justifying equality, Selected Papers from the Second Workshop on Pragmatics of Decision Procedures in Automated Reasoning , PDPAR'04, pp.69-85, 2005.

[. Detlefs, G. Nelson, and J. B. Saxe, Simplify: a theorem prover for program checking, Journal of the ACM, vol.52, issue.3, pp.365-473, 2005.
DOI : 10.1145/1066100.1066102

[. Davis and H. Putnam, A Computing Procedure for Quantification Theory, Journal of the ACM, vol.7, issue.3, pp.201-215, 1960.
DOI : 10.1145/321033.321034

A. Roth, A. Blome, R. Bubel, and S. Greiner, KeY quicktour for JML, pp.1-17, 2006.

[. Fontaine and E. P. Gribomont, Using BDDs with Combinations of Theories, Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR'02, pp.190-201, 2002.
DOI : 10.1007/3-540-36078-6_13

[. Flanagan, R. Joshi, X. Ou, and J. B. Saxe, Theorem Proving Using Lazy Proof Explication, Proceedings of the 15th International Conference on Computer Aided Verification, CAV'03, pp.355-367, 2003.
DOI : 10.1007/978-3-540-45069-6_34

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.9486

M. Fähndrich, K. Rustan, and M. Leino, Declaring and checking non-null types in an object-oriented language, Proceedings of the 18th ACM SIGPLAN International Conference on Object Oriented Programing, Systems, Languages, and Applications , OOPSLA'03, pp.302-312, 2003.

C. Flanagan, K. Rustan, M. Leino, M. Lillibridge, G. Nelson et al., Extended static checking for Java, Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation, PLDI'02, pp.234-245, 2002.

R. W. Floyd, Assigning meanings to programs Mathematical aspects of computer science, 1967.

N. Stephen, J. C. Freund, and . Mitchell, A type system for object initialization in the Java bytecode language, Proceedings of the 13th ACM SIGPLAN conference on Object- Oriented Programming, Systems, Languages, and Applications, OOPSLA'98, pp.310-327, 1998.

[. Filliâtre and C. Marché, The Why/Krakatoa/Caduceus Platform for Deductive Program Verification, Proceedings of the 19th International Conference on Computer Aided Verification, CAV'07, pp.173-177, 2007.
DOI : 10.1007/978-3-540-73368-3_21

P. Fontaine, J. Marion, S. Merz, L. P. Nieto, and A. Tiu, Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants, Proceedings of the 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS'06, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS'06, pp.167-181, 2006.
DOI : 10.1007/3-540-45620-1_26

URL : https://hal.archives-ouvertes.fr/inria-00001088

[. Flanagan and J. B. Saxe, Avoiding exponential explosion: Generating compact verification conditions, Conference Record of the 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL'01, pp.193-205, 2001.

H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, and C. Tinelli, DPLL(T): Fast Decision Procedures, Proceedings of the 16th International Conference on Computer Aided Verification, pp.175-188, 2004.
DOI : 10.1007/978-3-540-27813-9_14

[. Grégoire and X. Leroy, A compiled implementation of strong reduction, Proc. of ICFP 2002, pp.235-246, 2002.

[. Grégoire and A. Mahboubi, Proving Equalities in a Commutative Ring Done Right in Coq, Proceedings of the 18th International Conference on Theorem Proving in Higher Order Logics, TPHOLs'05, pp.98-113, 2005.
DOI : 10.1007/11541868_7

I. Evguenii, Y. Goldberg, and . Novikov, Verification of proofs of unsatisfiability for CNF formulas, Proceedings of the conference on Design, Automation and Test in Europe, DATE'03, pp.10886-10891, 2003.

I. Evguenii, Y. Goldberg, and . Novikov, BerkMin: A fast and robust Sat-solver, Discrete Applied Mathematics, vol.155, issue.12, pp.1549-1561, 2007.

P. Granger, Static analysis of linear congruence equalities among variables of a program, Proceedings of the International Joint Conference on Theory and Practice of Software Development , TAPSOFT'91, pp.169-192, 1991.
DOI : 10.1007/3-540-53982-4_10

[. Harper, F. Honsell, and G. Plotkin, A framework for defining logics, Journal of the ACM, vol.40, issue.1, pp.143-184, 1993.
DOI : 10.1145/138027.138060

M. Huisman and B. Jacobs, Java Program Verification via a Hoare Logic with Abrupt Termination, Proceedings of the Third Internationsl Conference on Fundamental Approaches to Software Engineering, FASE'00, held as part of the European Joint Conferences on the Theory and Practice of Software, pp.284-303, 2000.
DOI : 10.1007/3-540-46428-X_20

[. Hubert, T. Jensen, and D. Pichardie, Semantic Foundations and Inference of Non-null Annotations, Proceedings of the 10th IFIP WG 6.1 International Conference Formal Methods for Open Object-Based Distributed Systems, FMOODS'08, pp.132-149, 2008.
DOI : 10.1007/978-3-540-68863-1_9

URL : https://hal.archives-ouvertes.fr/inria-00332356

[. Herms, C. Marché, and B. Monate, A Certified Multi-prover Verification Condition Generator, Proceedings of the 4th international conference on Verified Software: Theories, Tools, Experiments, VSTTE'12, pp.2-17, 2012.
DOI : 10.1007/3-540-48118-4_45

URL : https://hal.archives-ouvertes.fr/hal-00639977

]. C. Hoa69 and . Hoare, An axiomatic basis for computer programming, Communications of the ACM, vol.12, issue.10, pp.576-580, 1969.

A. Nadeem, Z. Hamid, V. Shao, S. Trifonov, Z. Monnier et al., A syntactic approach to foundational proof-carrying code, Journal of Automated Reasoning, pp.31-34, 2003.

J. Hurd, . Integrating, and H. Gandalf, Integrating Gandalf and HOL, Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics, TPHOLs'99, pp.311-322, 1999.
DOI : 10.1007/3-540-48256-3_21

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.7221

B. Jacobs, J. Smans, and F. Piessens, A Quick Tour of the VeriFast Program Verifier, Proceedings of the 8th Asian conference on Programming languages and systems, APLAS'10, pp.304-311, 2010.
DOI : 10.1007/978-3-642-17164-2_21

B. Jacobs, J. Smans, and P. Philippaerts, VeriFast: A Powerful, Sound, Predictable, Fast Verifier for C and Java, Proceedings of the Third international conference on NASA Formal methods, pp.41-55, 2011.
DOI : 10.1007/11691372_19

M. Karr, Affine relationships among variables of a program, Acta Informatica, vol.6, issue.2, pp.133-151, 1976.
DOI : 10.1007/BF00268497

T. Ioannis and . Kassios, Dynamic frames: Support for framing, dependencies and sharing without restrictions, Proceedings of the 14th international symposium of Formal Methods, FM'06, pp.268-283, 2006.

G. Klein and T. Nipkow, Verified bytecode verifiers, Theoretical Computer Science, vol.298, issue.3, pp.583-626, 2003.
DOI : 10.1016/S0304-3975(02)00869-1

T. Gary, A. L. Leavens, C. Baker, and . Ruby, Preliminary design of JML : A behavioral interface specification language for Java, ACM SIGSOFT Software Engineering Notes, vol.31, issue.3, pp.1-38, 2006.

]. K. Lei10, M. Rustan, and . 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.

X. Leroy, Java bytecode verification: Algorithms and formalizations, Journal of Automated Reasoning, vol.30, issue.3/4, pp.235-269, 2003.
DOI : 10.1023/A:1025055424017

URL : https://hal.archives-ouvertes.fr/hal-01499939

X. Leroy, Formal certification of a compiler back-end or: programming a compiler with a proof assistant, Proc. of POPL 2006, pp.42-54, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00000963

T. Lindholm and F. Yellin, Java Virtual Machine Specification, 1999.

[. Mclaughlin, C. Barrett, and Y. Ge, Cooperating Theorem Provers: A Case Study Combining HOL-Light and CVC Lite, Electronic Notes in Theoretical Computer Science, vol.144, issue.2, pp.43-51, 2006.
DOI : 10.1016/j.entcs.2005.12.005

C. Marché and J. Filliâtre, The Krakatoa tool for deductive verification of Java programs, 2009.

A. Miné, Weakly relational numerical abstract domains, 2004.

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

M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik, Chaff, Proceedings of the 38th conference on Design automation , DAC '01, pp.530-535, 2001.
DOI : 10.1145/378239.379017

R. E. Moore, Interval arithmetic and automatic error analysis in digital computing, 1962.

M. Moskal, Rocket-Fast Proof Checking for SMT Solvers, Proceedings of the 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS'08, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS'08, pp.486-500, 2008.
DOI : 10.1007/978-3-540-78800-3_38

C. March and C. Paulin-mohring, Reasoning About Java Programs with Aliasing and Frame Conditions, Proceedings of the 18th International Conference on Theorem Proving in Higher Order Logics , TPHOLs'05, pp.179-194, 2005.
DOI : 10.1007/11541868_12

[. Marché, C. Paulin-mohring, and X. Urbain, The KRAKATOA tool for certificationof JAVA/JAVACARD programs annotated in JML, The Journal of Logic and Algebraic Programming, vol.58, issue.1-2, pp.89-106, 2004.
DOI : 10.1016/j.jlap.2003.07.006

. Meinke, V. John, and . Tucker, Many-sorted Logic and its Applications, 1993.

[. Morrisett, D. Walker, K. Crary, and N. Glew, From system F to typed assembly language, ACM Transactions on Programming Languages and Systems, vol.21, issue.3, pp.527-568, 1999.
DOI : 10.1145/319301.319345

C. George and . Necula, Proof-carrying code, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, POPL'97, pp.106-119, 1997.

C. George and . Necula, Compiling with Proofs, 1998.

C. George, P. Necula, and . Lee, The design and implementation of a certifying compiler, Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation, PLDI'98, pp.333-344, 1998.

C. George, P. Necula, and . Lee, Efficient representation and validation of proofs, Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science, LICS'98, pp.93-104, 1998.

C. George, P. Necula, and . Lee, Safe, untrusted agents using proof-carrying code, Mobile Agents and Security, pp.61-91, 1998.

C. George, P. Necula, and . Lee, Proof generation in the Touchstone theorem prover, Proceedings of the 17th International Conference on Automated Deduction , CADE'00, pp.25-44, 2000.

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

G. Nelson and D. C. Oppen, Simplification by Cooperating Decision Procedures, ACM Transactions on Programming Languages and Systems, vol.1, issue.2, pp.245-257, 1979.
DOI : 10.1145/357073.357079

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.2828

R. Nieuwenhuis and A. Oliveras, Proof-Producing Congruence Closure, Proceedings of the 16th International Conference on Rewriting Techniques and Applications, RTA'05, pp.453-468, 2005.
DOI : 10.1007/978-3-540-32033-3_33

R. Nieuwenhuis and A. Oliveras, Fast congruence closure and extensions, Information and Computation, vol.205, issue.4, pp.557-580937, 2006.
DOI : 10.1016/j.ic.2006.08.009

C. George, R. R. Necula, and . Schneck, A sound framework for untrusted verification-condition generators, Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science, LICS'03, pp.248-260, 2003.

A. Paskevich, Algebraic types and pattern matching in the logical language of the Why verification platform, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00439232

[. Pichardie, Interprétation abstraite en logique intuitionniste: extraction d'analyseurs Java certifiés System description: Twelf ? a meta-logical framework for deductive systems, Proceedings of the16th International Conference on Automated Deduction, CADE'99, pp.202-206, 1999.

C. Lawrence, K. Paulson, and . Susanto, Source-level proof reconstruction for interactive theorem proving, Proceedings of the 20th International Conference on Theorem Proving in Higher Order Logics, TPHOLs'07, pp.232-245, 2007.

[. Pusch, Proving the Soundness of a Java Bytecode Verifier Specification in Isabelle/HOL, Lecture Notes in Computer Science, vol.1579, pp.89-103, 1999.
DOI : 10.1007/3-540-49059-0_7

J. M. Rushby, Design and verification of secure systems

A. Riazanov, A. Voronkov, and . Vampire, Vampire, Proceedings of the 16th International Conference on Automated Deduction, CADE'99, pp.292-296, 1999.
DOI : 10.1007/3-540-48660-7_26

C. Sinz and A. Biere, Extended Resolution Proofs for Conjoining BDDs, First International Computer Science Symposium in Russia, Theory and Applications, pp.600-611, 2006.
DOI : 10.1007/11753728_60

A. Schrijver, Theory of Linear and Integer Programming, 1998.

[. Schulz, E ? a brainiac theorem prover, pp.111-126, 2002.

[. Stengle, A nullstellensatz and a positivstellensatz in semialgebraic geometry, Mathematische Annalen, vol.8, issue.2, pp.87-97, 1973.
DOI : 10.1007/BF01362149

A. Stump, Proof Checking Technology for Satisfiability Modulo Theories, Electronic Notes in Theoretical Computer Science, vol.228, pp.121-133, 2009.
DOI : 10.1016/j.entcs.2008.12.121

G. Sutcliffe, The TPTP Problem Library and Associated Infrastructure, Journal of Automated Reasoning, vol.13, issue.2, pp.337-362, 2009.
DOI : 10.1007/s10817-009-9143-8

. Van02-]-allen-van-gelder, Extracting (easily) checkable proofs from a satisfiability solver that employs both preorder and postorder resolution, Online proceedings of the 7th International Symposium on Artificial Intelligence and Mathematics, AMAI'02, pp.1-10, 2002.

. Van07-]-allen-van-gelder, Verifying propositional unsatisfiability: Pitfalls to avoid, Proceedings of the 10th International Conference theory and Applications of Satisfiability Testing, SAT'07, pp.328-333, 2007.

. Van12-]-allen-van-gelder, Producing and verifying extremely large propositional refutations, Annals of Mathematics and Artificial Intelligence, vol.43, issue.1???4, pp.329-372, 2012.
DOI : 10.1007/s10472-012-9322-x

. Joachim-van-den, B. Berg, and . Jacobs, The loop Compiler for Java and JML, Lecture Notes in Computer Science, vol.2031, pp.299-312, 2001.
DOI : 10.1007/3-540-45319-9_21

[. Vogels, B. Jacobs, and F. Piessens, A machinechecked soundness proof for an efficient verification condition generator, Proceedings of the 2010 ACM Symposium on Applied Computing , SAC'10, pp.2517-2522, 2010.

[. Weber and H. Amjad, Efficiently checking propositional refutations in HOL theorem provers, Journal of Applied Logic, vol.7, issue.1, pp.26-40, 2009.
DOI : 10.1016/j.jal.2007.07.003

H. Wasserman and M. Blum, Software reliability via run-time result-checking, Journal of the ACM, vol.44, issue.6, pp.826-849, 1997.
DOI : 10.1145/268999.269003

[. Wegbreit, The synthesis of loop predicates, Communications of the ACM, vol.17, issue.2, pp.102-113, 1974.
DOI : 10.1145/360827.360850

K. Andrew, M. Wright, and . Felleisen, A syntactic approach to type soundness. Information and computation, pp.38-94, 1994.

M. Wilkes, Memoirs of a Computer Pioneer, 1985.

M. Wildmoser and T. Nipkow, Asserting Bytecode Safety, Proceedings of the 14th European Symposium on Programming Languages and Systems, ESOP'05, pp.326-341, 2005.
DOI : 10.1007/978-3-540-31987-0_23

[. Wildmoser, T. Nipkow, G. Klein, and S. Nanz, Prototyping Proof Carrying Code, Exploring New Frontiers of Theoretical Informatics, IFIP 18th World Computer Congress, TC1 3rd International Conference on Theoretical Computer Science, TCS'04 IFIP International Federation for Information Processing, pp.333-347, 2004.
DOI : 10.1007/1-4020-8141-3_27

H. Zantema and J. F. Groote, Transforming equality logic to propositional logic, Electronic Notes in Theoretical Computer Science, vol.86, issue.1, pp.162-173, 2003.
DOI : 10.1016/S1571-0661(04)80661-3

[. Zhang, Validating SAT solvers using an independent resolution-based checker: Practical implementations and other applications, Proc. of DATE 2003, pp.10880-10885, 2003.