A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality

Jasmin Christian Blanchette 1, 2 Mathias Fleury 2, 1 Christoph Weidenbach 2, 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 [41 references]  Display  Hide  Download
https://hal.inria.fr/hal-01336074
Contributor : Jasmin Blanchette <>
Submitted on : Wednesday, June 22, 2016 - 3:53:14 PM
Last modification on : Tuesday, February 19, 2019 - 3:40:03 PM

File

main.pdf
Files produced by the author(s)

Identifiers

Collections

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

Citation

Jasmin Christian Blanchette, Mathias Fleury, Christoph Weidenbach. A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality. 8th International Joint Conference on Automated Reasoning (IJCAR 2016), Jun 2016, Coimbra, Portugal. ⟨10.1007/978-3-319-40229-1_4⟩. ⟨hal-01336074⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

258

Files downloads

223

 

 

Contact

archive-ouverte@inria.fr