A verified SAT solver with watched literals using imperative HOL - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

A verified SAT solver with watched literals using imperative HOL

(1) , (2, 3, 4) , (5)
1
2
3
4
5

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.
Fichier principal
Vignette du fichier
sat_2wl_paper.pdf (697.97 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01904647 , version 1 (25-10-2018)

Identifiers

Cite

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⟩
136 View
252 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More