| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality (Extended Abstract)
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.
Cited literature [16 references]
https://hal.inria.fr/hal-01401807
Contributor : Jasmin Blanchette Connect in order to contact the contributor
Submitted on : Wednesday, November 23, 2016 - 5:44:39 PM
Last modification on : Wednesday, November 3, 2021 - 7:57:37 AM
Long-term archiving on: : Tuesday, March 21, 2017 - 12:46:56 AM
Contributor : Jasmin Blanchette Connect in order to contact the contributor
Submitted on : Wednesday, November 23, 2016 - 5:44:39 PM
Last modification on : Wednesday, November 3, 2021 - 7:57:37 AM
Long-term archiving on: : Tuesday, March 21, 2017 - 12:46:56 AM
File
sat_abs.pdf
Files produced by the author(s)