M. Armand, B. Grégoire, A. Spiwack, and L. Théry, Extending Coq with Imperative Features and Its Application to SAT Verification, pp.83-98
DOI : 10.1007/978-3-642-14052-5_8
URL : https://hal.archives-ouvertes.fr/inria-00502496

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

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

S. Böhme and T. Weber, Fast LCF-Style Proof Reconstruction for Z3, pp.179-194
DOI : 10.1007/978-3-642-14052-5_14

M. Dénès, Coq with native compilation, https://github.com/maximedenes

P. Fontaine, J. Y. Marion, S. Merz, L. Nieto, and A. Tiu, Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants, TACAS. LNCS, pp.167-181, 2006.
DOI : 10.1007/3-540-45620-1_26
URL : https://hal.archives-ouvertes.fr/inria-00001088

M. Kaufmann and L. C. Paulson, Interactive Theorem Proving, Proceedings, Lecture Notes in Computer Science, vol.6172, 2010.
DOI : 10.1007/978-3-642-14052-5

S. Lescuyer and S. Conchon, Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme, FroCos. LNCS, pp.287-303, 2009.
DOI : 10.1016/j.jal.2007.07.003

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

R. Nieuwenhuis, A. Oliveras, and C. Tinelli, Solving SAT and SAT Modulo Theories, Journal of the ACM, vol.53, issue.6, pp.937-977, 2006.
DOI : 10.1145/1217856.1217859

D. Oe and A. Stump, Extended Abstract: Combining a Logical Framework with an RUP Checker for SMT Proofs, Proceedings of the 9th International Workshop on Satisfiability Modulo Theories, 2011.

G. S. Tseitin, On the complexity of proofs in propositional logics Automation of Reasoning: Classical Papers in Computational Logic, 1967.

T. Weber, SAT-based Finite Model Generation for Higher-Order Logic, 2008.