Efficient Verified (UN)SAT Certificate Checking [chapter]

Peter Lammich
2017 Lecture Notes in Computer Science  
We present an efficient formally verified checker for satisfiability and unsatisfiability certificates for Boolean formulas in conjunctive normal form. It utilizes a two phase approach: Starting from a DRAT certificate, the unverified generator computes an enriched certificate, which is checked against the original formula by the verified checker. Using the Isabelle/HOL Refinement Framework, we verify the actual implementation of the checker, specifying the semantics of the formula down to the
more » ... nteger sequence that represents it. On a realistic benchmark suite drawn from the 2016 SAT competition, our approach is more than two times faster than the unverified standard tool drat-trim. Additionally, we implemented a multi-threaded version of the generator, which further reduces the runtime.
doi:10.1007/978-3-319-63046-5_15 fatcat:dgzevmsvvbathmt37dpku3qqsi