Verification in ACL2 of a generic framework to synthesize SAT-provers

DOI10.1007/3-540-45013-0_15MaRDI QIDQ3079919zbMATH OpenOpenAlexFDO

Authors Francisco Jesús Martín-Mateos, Jose Antonio Alonso, María José Hidalgo, José Luis Ruiz-Reina

Publication date 4 March 2011

Published in Logic Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45013-0_15

Mathematics Subject Classification ID

Recommendations

• Formal verification of a generic framework to synthesize SAT-provers
• A verified SAT solver framework with learn, forget, restart, and incrementality
• The mechanical verification of a DPLL-based satisfiability solver
• Mechanical verification of SAT refutations with extended resolution
• Efficient, verified checking of propositional proofs

Cited in

(7)

• Satallax: An Automatic Higher-Order Prover
• Verified AIG algorithms in ACL2
• Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL
• Formal proofs about rewriting using ACL2
• Linear templates of ACTL formulas with an application to SAT-based verification
• Formal verification of a generic framework to synthesize SAT-provers
• A SAT-Based Decision Procedure for the Subclass of Unrollable List Formulas in ACL2 (SULFA)

Describes a project that uses

Uses Software

• TOY
• ECCE
• ACL2

This page was built for publication: Verification in ACL2 of a generic framework to synthesize SAT-provers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3079919)