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.
https://hal.inria.fr/hal-01401807
Contributeur : Jasmin Christian Blanchette
<>
Soumis le : mercredi 23 novembre 2016 - 17:44:39
Dernière modification le : mardi 2 octobre 2018 - 11:28:30
Document(s) archivé(s) le : mardi 21 mars 2017 - 00:46:56
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〉
