Skip to Main content Skip to Navigation
Conference papers

A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality (Extended Abstract)

Jasmin Christian Blanchette 1, 2, 3 Mathias Fleury 1, 2 Christoph Weidenbach 1, 2
2 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
MPII - Max-Planck-Institut für Informatik, Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
3 MOSEL - Proof-oriented development of computer-based systems
LORIA - FM - Department of Formal Methods
Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Jasmin Blanchette Connect in order to contact the contributor
Submitted on : Wednesday, November 23, 2016 - 5:44:39 PM
Last modification on : Wednesday, November 3, 2021 - 7:57:37 AM
Long-term archiving on: : Tuesday, March 21, 2017 - 12:46:56 AM


Files produced by the author(s)


  • HAL Id : hal-01401807, version 1



Jasmin Christian Blanchette, Mathias Fleury, Christoph Weidenbach. A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality (Extended Abstract). Isabelle Workshop 2016, Aug 2016, Nancy, France. ⟨hal-01401807⟩



Record views


Files downloads