A verified SAT solver with watched literals using imperative HOL

Abstract : Based on our earlier formalization of conflict-driven clause learning (CDCL) in Isabelle/HOL, we refine the CDCL calculus to add a crucial optimization: two watched literals. We formalize the data structure and the invariants. Then we refine the calculus to obtain an executable SAT solver. Through a chain of refinements carried out using the Isa-belle Refinement Framework, we target Imperative HOL and extract imperative Standard ML code. Although our solver is not competitive with the state of the art, it offers acceptable performance for some applications, and heuristics can be added to improve it further.
Document type :
Conference papers
Complete list of metadatas

Cited literature [39 references]  Display  Hide  Download

https://hal.inria.fr/hal-01904647
Contributor : Jasmin Blanchette <>
Submitted on : Thursday, October 25, 2018 - 11:05:40 AM
Last modification on : Tuesday, February 19, 2019 - 3:40:04 PM

File

sat_2wl_paper.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Mathias Fleury, Jasmin Christian Blanchette, Peter Lammich. A verified SAT solver with watched literals using imperative HOL. CPP 2018 - The 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, Jan 2018, Los Angeles, United States. ⟨10.1145/3167080⟩. ⟨hal-01904647⟩

Share

Metrics

Record views

52

Files downloads

43