A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses

Michaël Armand Germain Faure Benjamin Grégoire Chantal Keller Laurent Thery Benjamin Werner 2011 A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses CPP '11 LNCS 7086 Springer 135–150 10.1007/978-3-642-25379-9_12 Gilles Audemard Laurent Simon 2009 Predicting Learnt Clauses Quality in Modern SAT Solvers IJCAI '09 IJCAI Organization 399–404 Armin Biere 2012 Lingeling and Friends Entering the SAT Challenge 2012 Proc. SAT Challenge 2012 Department of Computer Science Series of Publications B B-2012-2 University of Helsinki 33–34 Sascha Böhme Anthony Fox Thomas Sewell Tjark Weber 2011 Reconstruction of Z3's Bit-Vector Proofs in HOL4 and Isabelle/HOL CPP '11 LNCS 7086 Springer 183–198 10.1007/978-3-642-25379-9_15 Robert S. Boyer Warren A. Hunt, Jr. 2006 Function Memoization and Unique Object Representation for ACL2 Functions ACL2 '06 ACM 81–89 10.1145/1217975.1217992 Robert S. Boyer J Strother Moore 2002 Single-Threaded Objects in ACL2 PADL '02 LNCS 2257 Springer 9–27 10.1007/3-540-45587-6_3 Aaron R. Bradley 2012 Understanding IC3 SAT '12 LNCS 7317 Springer 1–14 10.1007/978-3-642-31612-8_1 Robert Brayton Alan Mishchenko 2010 ABC: An Academic Industrial-Strength Verification Tool CAV '10 LNCS 6174 Springer 24–40 10.1007/978-3-642-14295-6_5 Robert Brummayer Armin Biere 2006 Local Two-Level And-Inverter Graph Minimization without Blowup MEMICS '06 Robert Brummayer Armin Biere 2009 Fuzzing and Delta-Debugging SMT Solvers SMT '09 ACM 1–5 10.1145/1670412.1670413 Satrajit Chatterjee Alan Mishchenko Robert Brayton Andreas Kuehlmann 2007 On resolution proofs for combinational equivalence DAC '07 ACM 600–605 10.1145/1278480.1278631 Ashish Darbari Bernd Fischer Jotilde07Eao Marques-Silva 2010 Industrial-Strength Certified SAT Solving through Verified SAT Proof Checking ICTAC '10 LNCS 6255 Springer 260–274 10.1007/978-3-642-14808-8_18 Jared Davis 2004 Finite Set Theory based on Fully Ordered Lists ACL2 '04 Niklas Eén Alan Mishchenko Robert K. Brayton 2011 Efficient implementation of property directed reachability FMCAD '11 FMCAD, Inc. 125–134 Niklas Eén Alan Mishchenko Niklas Sörensson 2007 Applying Logic Synthesis for Speeding Up SAT SAT '07 LNCS 4501 Springer 272–286 10.1007/978-3-540-72788-0_26 Niklas Eén Niklas Sörensson 2003 An Extensible SAT-solver SAT '03 LNCS 2919 Springer 502–518 10.1007/978-3-540-24605-3_37 Anthony Fox 2011 LCF-Style Bit-Blasting in HOL4 ITP '11 LNCS Springer 357–362 10.1007/978-3-642-22863-6_26 Michael J. Gordon Arthur J. Milner Christopher P. Wadsworth 1979 Edinburgh LCF: A Mechanized Logic of Computation LNCS 78 Springer 10.1007/3-540-09724-4 David Greve 2009 Automated Reasoning with Quantified Formulae ACL2 '09 ACM 110–113 10.1145/1637837.1637855 Warren A. Hunt, Jr. Matt Kaufmann Robert Bellarmine Krug J Moore Eric Whitman Smith 2005 Meta Reasoning in ACL2 TPHOLs '05 LNCS 3603 Springer 163–178 10.1007/11541868_11 Warren A. Hunt, Jr. Sol Swords Jared Davis Anna Slobodová 2010 Use of Formal Verification at Centaur Technology David Hardin Design and Verification of Microprocessor Systems for High-Assurance Applications Springer 65–88 10.1007/978-1-4419-1539-9_3 Matt Kaufmann J Strother Moore 2011 How Can I Do That with ACL2? Recent Enhancements to ACL2 ACL2 '11 46–60 10.4204/EPTCS.70.4 Filip Mari\'c 2009 Formalization and Implementation of Modern SAT Solvers Journal of Automated Reasoning 43 1 81–119 10.1007/s10817-009-9127-8 Alan Mishchenko Michael Case Robert Brayton Stephen Jang 2008 Scalable and scalably-verifiable sequential synthesis ICCAD '08 IEEE 234–241 10.1109/ICCAD.2008.4681580 Alan Mishchenko Satrajit Chatterjee Robert Brayton 2006 DAG-Aware AIG Rewriting: A Fresh Look at Combinational Logic Synthesis DAC '06 ACM 532–535 10.1145/1146909.1147048 Alan Mishchenko Satrajit Chatterjee Roland Jiang Robert Brayton 2005 FRAIGs: A Unifying Representation for Logic Synthesis and Verification Technical Report EECS Dept., UC Berkeley Duckki Oe Aaron Stump Corey Oliver Kevin Clancy 2012 versat: A Verified Modern SAT Solver VMCAI '12 LNCS 7148 Springer 363–378 10.1007/978-3-642-27940-9_24 Sol Swords Jared Davis 2011 Bit-Blasting ACL2 Theorems ACL2 '11 Electronic Proceedings in Theoretical Computer Science 70 84–102 10.4204/EPTCS.70.7 Sol Swords Warren A. Hunt, Jr. 2010 A Mechanically Verified AIG to BDD Conversion Algorithm ITP '10 LNCS 6172 Springer 435–449 10.1007/978-3-642-14052-5_30 G. S. Tseitin 1968 On the Complexity of Derivation in Propositional Calculus Zapiski nauchnykh seminarov LOMI 8 234–259 10.1007/978-3-642-81955-1_28 English translation of this volume: Consultants Bureau, N.Y., 1970, pp. 115–125 Tjark Weber Hasan Amjad 2009 Efficiently Checking Propositional Refutations in HOL Theorem Provers Journal of Applied Logic 7 1 26–40 10.1016/j.jal.2007.07.003 Nathan Wetzler Marijn J. H. Heule Warren A. Hunt, Jr. 2013 Mechanical Verification of SAT Refutations with Extended Resolution To appear in ITP 2013