A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

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

(1, 2, 3) , (2, 1) , (2, 1)
1
2
3

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

Dates and versions

hal-01336074 , version 1 (22-06-2016)

Identifiers

Cite

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⟩
119 View
121 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More