TY - GEN
T1 - A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality
AU - Blanchette, J.C.
AU - Fleury, Mathias
AU - Weidenbach, Christoph
PY - 2016
Y1 - 2016
N2 - We developed a formal framework for CDCL (conflict-driven clause learning) in Isabelle/HOL. Through a chain of refinements, an abstract CDCL calculus is connected to a SAT solver expressed in a functional programming language, with total correctness guarantees. The framework offers a convenient way to prove metatheorems and experiment with variants. Compared with earlier SAT solver verifications, the main novelties are the inclusion of rules for forget, restart, and incremental solving and the application of refinement.
AB - We developed a formal framework for CDCL (conflict-driven clause learning) in Isabelle/HOL. Through a chain of refinements, an abstract CDCL calculus is connected to a SAT solver expressed in a functional programming language, with total correctness guarantees. The framework offers a convenient way to prove metatheorems and experiment with variants. Compared with earlier SAT solver verifications, the main novelties are the inclusion of rules for forget, restart, and incremental solving and the application of refinement.
U2 - 10.1007/978-3-319-40229-1_4
DO - 10.1007/978-3-319-40229-1_4
M3 - Conference contribution
SN - 978-3-319-40228-4
T3 - Lecture Notes in Computer Science
SP - 25
EP - 44
BT - Automated Reasoning - 8th International Joint Conference
PB - Springer
ER -