Efficient Certified RAT Verification

Clausal proofs have become a popular approach to validate the results of SAT solvers. However, validating clausal proofs in the most widely supported format (DRAT) is expensive even in highly optimized implementations. We present a new format, called LRAT, which extends the DRAT format with hints that facilitate a simple and fast validation algorithm. Checking validity of LRAT proofs can be implemented using trusted systems such as the languages supported by theorem provers. We demonstrate this by implementing two certified LRAT checkers, one in Coq and one in ACL2.

[1]  Marijn J. H. Heule,et al.  Expressing Symmetry Breaking in DRAT Proofs , 2015, CADE.

[2]  Marijn J. H. Heule.  Proofs for Satisfiability Problems , 2014 .

[3]  Sharad Malik,et al.  Validating SAT solvers using an independent resolution-based checker: practical implementations and other applications , 2003, 2003 Design, Automation and Test in Europe Conference and Exhibition.

[4]  Bernd Fischer,et al.  Industrial-Strength Certified SAT Solving through Verified SAT Proof Checking , 2010, ICTAC.

[5]  Victor W. Marek,et al.  Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer , 2016, SAT.

[6]  Peter Lammich.  Efficient Verified (UN)SAT Certificate Checking , 2017, CADE.

[7]  Marijn Heule,et al.  Mechanical Verification of SAT Refutations with Extended Resolution , 2013, ITP.

[8]  Armin Biere,et al.  Bounded Model Checking Using Satisfiability Solving , 2001, Formal Methods Syst. Des..

[9]  Allen Van Gelder,et al.  Producing and verifying extremely large propositional refutations , 2012, Annals of Mathematics and Artificial Intelligence.

[10]  Filip Maric,et al.  Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL , 2010, Theor. Comput. Sci..

[11]  Allen Van Gelder.  Producing and verifying extremely large propositional refutations Have your cake and eat it too , 2012 .

[12]  Lawrence Charles Paulson,et al.  Isabelle/HOL: A Proof Assistant for Higher-Order Logic , 2002 .

[13]  J. Strother Moore,et al.  An Industrial Strength Theorem Prover for a Logic Based on Common Lisp , 1997, IEEE Trans. Software Eng..

[14]  Marijn J. H. Heule,et al.  DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs , 2014, SAT.

[15]  Armando Tacchella,et al.  Benefits of Bounded Model Checking at an Industrial Setting , 2001, CAV.

[16]  Malay K. Ganai,et al.  Efficient SAT-based bounded model checking for software verification , 2008, Theor. Comput. Sci..

[17]  F. Mari.  Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL , 2010 .

[18]  Armin Biere,et al.  Automated Reencoding of Boolean Formulas , 2012, Haifa Verification Conference.

[19]  Armin Biere,et al.  Compositional Propositional Proofs , 2015, LPAR.

[20]  Joao Marques-Silva,et al.  Efficient Certified Resolution Proof Checking , 2016, TACAS.

[21]  Eugene Goldberg,et al.  Verification of proofs of unsatisfiability for CNF formulas , 2003, 2003 Design, Automation and Test in Europe Conference and Exhibition.

[22]  Marijn Heule.  The DRAT format and DRAT-trim checker , 2016, ArXiv.

[23]  Christoph Weidenbach,et al.  A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality , 2016, Journal of Automated Reasoning.

[24]  Marijn J. H. Heule,et al.  Bridging the gap between easy generation and efficient verification of unsatisfiability proofs , 2014, Softw. Test. Verification Reliab..

[25]  Marijn J. H. Heule,et al.  Trimming while checking clausal proofs , 2013, 2013 Formal Methods in Computer-Aided Design.

[26]  Predrag Janicic,et al.  Formalization of Abstract State Transition Systems for SAT , 2011, Log. Methods Comput. Sci..

[27]  Pierre Letouzey.  Extraction in Coq: An Overview , 2008, CiE.

[28]  James M. Crawford,et al.  Symmetry-Breaking Predicates for Search Problems , 1996, KR.

[29]  Marijn J. H. Heule,et al.  SAT Competition 2016: Recent Developments , 2017, AAAI.