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

Jasmin Christian Blanchette 1, 2 Mathias Fleury 1, 2 Christoph Weidenbach 1
1 MPII - Max-Planck-Institut für Informatik
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
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 metadatas

Cited literature [16 references]  Display  Hide  Download
https://hal.inria.fr/hal-01401807
Contributor : Jasmin Blanchette <>
Submitted on : Wednesday, November 23, 2016 - 5:44:39 PM
Last modification on : Tuesday, February 19, 2019 - 3:40:04 PM
Long-term archiving on: Tuesday, March 21, 2017 - 12:46:56 AM

File

sat_abs.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01401807, version 1

Collections

CNRS | INRIA | LORIA | LORIA-FM | UNIV-LORRAINE

Citation

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

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

179

Files downloads

39

 

 

Contact

archive-ouverte@inria.fr