Efficient, mechanically-verified validation of satisfiability solvers
Satisfiability (SAT) solvers are commonly used for a variety of applications, including hardware verification, software verification, theorem proving, debugging, and hard combinatorial problems. These applications rely on the efficiency and correctness of SAT solvers. When a problem is determined to...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
2015
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/2152/30538 |