Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL.
Filip MaricPublished in: Theor. Comput. Sci. (2010)
Keyphrases
- formal verification
- sat solvers
- theorem prover
- natural deduction
- model checker
- model checking
- orders of magnitude
- constraint satisfaction
- sat solving
- boolean satisfiability
- inference rules
- sat problem
- search space
- max sat
- sat instances
- theorem proving
- propositional satisfiability
- first order logic
- search strategies
- vector space
- constraint solver
- automated reasoning
- formal methods
- temporal logic
- boolean formula
- symmetry breaking
- clause learning
- planning domains
- sat encodings
- search algorithm