G. Audemard and L. Simon, Predicting Learnt Clauses Quality in Modern SAT Solvers, IJCAI 2009, Craig Boutilier (Ed.). ijcai.org, pp.399-404, 2009.

L. Bachmair and H. Ganzinger, Resolution Theorem Proving, Handbook of Automated Reasoning, pp.19-99, 2001.

U. Berger and A. Lawrence, Extracting Verified Decision Procedures: DPLL and Resolution, Logical Methods in Computer Science, vol.11, p.1, 2015.

A. Biere, Splatz, Lingeling, Plingeling, Treengeling, YalSAT Entering the SAT Competition, pp.44-45, 2016.

A. Biere and A. Fröhlich, Evaluating CDCL Variable Scoring Schemes, SAT 2015 (LNCS), vol.9340, pp.405-422, 2015.

A. Biere and M. Heule, Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol.185, 2009.

M. Jasmin-christian-blanchette, C. Fleury, and . Weidenbach, A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality, IJCAR 2016 (LNCS), vol.9706, pp.25-44, 2016.

L. Bulwahn, A. Krauss, F. Haftmann, L. Erkök, and J. Matthews, Imperative Functional Programming with Isabelle/HOL, TPHOLs 2008 (LNCS), vol.5170, pp.134-149, 2008.

L. Cruz-filipe, J. H. Marijn, W. A. Heule, M. Hunt, P. Kaufmann et al., Efficient Certified RAT Verification, CADE-26 (LNCS), vol.10395, pp.220-236, 2017.

L. Cruz-filipe, J. Marques-silva, and P. Schneider-kamp, Efficient Certified Resolution Proof Checking, TACAS 2017, 2017.

M. Davis, G. Logemann, and D. W. Loveland, A Machine Program for Theorem-Proving, Commun. ACM, vol.5, pp.394-397, 1962.

B. Delaware, C. Pit-claudel, J. Gross, and A. Chlipala, Fiat: Deductive Synthesis of Abstract Data Types in a CPP'18, 2015.

M. Fleury, J. C. Blanchette, and P. , Lammich Proof Assistant, pp.689-700

N. Eén and N. Sörensson, An Extensible SAT-Solver, SAT 2003 (LNCS), vol.2919, pp.502-518, 2003.

M. Fleury and J. C. Blanchette, Formalization of Weidenbach's Automated Reasoning-The Art of Generic Problem Solving, 2017.

D. Gries and D. M. Volpano, The Transform-A New Language Construct, Structured Programming, vol.11, pp.1-10, 1990.

F. Haftmann and T. Nipkow, Code Generation via Higher-Order Rewrite Systems, FLOPS 2010 (LNCS), vol.6009, pp.103-117, 2010.

M. Heule, W. A. Hunt, and N. Wetzler, Bridging the Gap between Easy Generation and Efficient Verification of Unsatisfiability Proofs, Softw. Test. Verif. Reliab, vol.24, pp.593-607, 2014.

M. Heule, W. A. Hunt, M. Kaufmann, and N. Wetzler, Efficient, Verified Checking of Propositional Proofs, ITP 2017 (LNCS), vol.10499, pp.269-284, 2017.

P. Lammich, Automatic Data Refinement, ITP 2013 (LNCS), vol.7998, pp.84-99, 2013.
DOI : 10.1007/978-3-642-39634-2_9

P. Lammich, Refinement to Imperative/HOL, ITP 2015, vol.9236, pp.253-269, 2015.
DOI : 10.1007/978-3-319-22102-1_17

P. Lammich, Refinement Based Verification of Imperative Data Structures, pp.27-36, 2016.
DOI : 10.1145/2854065.2854067

P. Lammich, The GRAT Tool Chain-Efficient (UN)SAT Certificate Checking with Formal Correctness Guarantees, SAT 2017 (LNCS), vol.10491, pp.457-463, 2017.
DOI : 10.1007/978-3-319-63046-5_15

P. Lammich and T. Tuerk, Applying Data Refinement for Monadic Programs to Hopcroft's Algorithm, ITP 2012 (LNCS), vol.7406, pp.166-182, 2012.
DOI : 10.1007/978-3-642-32347-8_12

S. Lescuyer, Formalizing and Implementing a Reflexive Tactic for Automated Deduction in Coq, Ph.D. Dissertation, 2011.
URL : https://hal.archives-ouvertes.fr/tel-00713668

F. Mari?, Formal Verification of Modern SAT Solvers. Archive of Formal Proofs, 2008.

F. Mari?, Formal Verification of a Modern SAT Solver by Shallow Embedding into Isabelle/HOL, Theor. Comput. Sci, vol.411, pp.4333-4356, 2010.

D. Matichuk, T. C. Murray, and M. Wenzel, Eisbach: A Proof Method Language for Isabelle, J. Autom. Reasoning, vol.56, pp.261-282, 2016.
DOI : 10.1007/s10817-015-9360-2

M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik, Chaff: Engineering an Efficient SAT Solver, DAC, pp.530-535, 2001.
DOI : 10.1109/dac.2001.935565
URL : http://www.cs.wm.edu/~idillig/cs780-02/chaff.pdf

R. Nieuwenhuis, A. Oliveras, and C. Tinelli, Solving SAT and SAT Modulo Theories: From an Abstract Davis-PutnamLogemann-Loveland Procedure to DPLL(T), J. ACM, vol.53, issue.6, pp.937-977, 2006.
DOI : 10.1145/1217856.1217859

D. Oe, A. Stump, C. Oliver, and K. Clancy, versat: A Verified Modern SAT Solver, LNCS, vol.7148, pp.363-378, 2012.
DOI : 10.1007/978-3-642-27940-9_24
URL : http://homepage.divms.uiowa.edu/~astump/papers/vmcai12.pdf

K. Pipatsrisawat and A. Darwiche, A Lightweight Component Caching Scheme for Satisfiability Solvers, SAT 2007 (LNCS), vol.4501, pp.294-299, 2007.
DOI : 10.1007/978-3-540-72788-0_28
URL : http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.207.2240&rep=rep1&type=pdf

L. Ryan, Efficient Algorithms for Clause-Learning SAT Solvers, 2004.

N. Shankar and M. Vaucher, The Mechanical Verification of a DPLL-Based Satisfiability Solver, Electr. Notes Theor. Comput. Sci, vol.269, pp.3-17, 2011.

N. Sörensson and A. Biere, Minimizing Learned Clauses, SAT 2009 (LNCS), Oliver Kullmann, vol.9340, pp.237-243, 2009.

A. Stump, M. Deters, A. Petcher, T. Schiller, and T. W. Simpson, Verified Programming in Guru, pp.49-58, 2009.
DOI : 10.1145/1481848.1481856
URL : http://guru-lang.googlecode.com/svn/branches/1.0a/doc/book.pdf

R. Thiemann and C. Sternagel, Certification of Termination Proofs Using CeTA, TPHOLs 2009 (LNCS), vol.5674, pp.452-468, 2009.
DOI : 10.1007/978-3-642-03359-9_31
URL : http://cl-informatik.uibk.ac.at/~thiemann/paper/TPHOLs09CeTA.pdf

C. W. , .. ;. , and R. Meyer, Automated Reasoning Building Blocks, Correct System Design: Symposium in Honor of Ernst-Rüdiger Olderog on the Occasion of His 60th Birthday (LNCS), vol.9360, pp.172-188, 2015.

N. Wetzler, J. H. Marijn, W. A. Heule, and . Hunt, DRATtrim: Efficient Checking and Trimming Using Expressive Clausal Proofs, SAT 2014 (LNCS), vol.8561, pp.422-429, 2014.
DOI : 10.1007/978-3-319-09284-3_31