Efficient Verified (UN)SAT Certificate Checking
Author:
Open Access
- 4 June 2019
- journal article
- research article
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 64 (3) , 513-532
Abstract
No abstract availableKeywords
Funding Information
- DFG (LA 3292/1)
This publication has 36 references indexed in Scilit:
- A Fully Verified Executable LTL Model Checker2013
- Automatic Data Refinement2013
- Mechanical Verification of SAT Refutations with Extended Resolution2013
- Data Refinement in Isabelle/HOL2013
- Applying Data Refinement for Monadic Programs to Hopcroft’s Algorithm2012
- Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOLTheoretical Computer Science, 2010
- Industrial-Strength Certified SAT Solving through Verified SAT Proof CheckingLecture Notes in Computer Science, 2010
- Imperative Functional Programming with Isabelle/HOL2008
- Extended Resolution Proofs for Conjoining BDDsLecture Notes in Computer Science, 2006
- Program development by stepwise refinementCommunications of the ACM, 1971