Computer Science – Logic in Computer Science
Scientific paper
2011-08-22
LMCS 7 (3:19) 2011
Computer Science
Logic in Computer Science
Scientific paper
10.2168/LMCS-7(3:19)2011
We present a formalization of modern SAT solvers and their properties in a form of abstract state transition systems. SAT solving procedures are described as transition relations over states that represent the values of the solver's global variables. Several different SAT solvers are formalized, including both the classical DPLL procedure and its state-of-the-art successors. The formalization is made within the Isabelle/HOL system and the total correctness (soundness, termination, completeness) is shown for each presented system (with respect to a simple notion of satisfiability that can be manually checked). The systems are defined in a general way and cover procedures used in a wide range of modern SAT solvers. Our formalization builds up on the previous work on state transition systems for SAT, but it gives machine-verifiable proofs, somewhat more general specifications, and weaker assumptions that ensure the key correctness properties. The presented proofs of formal correctness of the transition systems can be used as a key building block in proving correctness of SAT solvers by using other verification approaches.
Janicic Predrag
Maric Filip
No associations
LandOfFree
Formalization of Abstract State Transition Systems for SAT does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Formalization of Abstract State Transition Systems for SAT, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Formalization of Abstract State Transition Systems for SAT will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-176656