Progress in Certifying Hardware Model Checking Results
Emily Yu, Armin Biere, Keijo Heljanko
Abstract
Abstract We present a formal framework to certify k -induction-based model checking results. The key idea is the notion of a k -witness circuit which simulates the given circuit and has a simple inductive invariant serving as proof certificate. Our approach allows to check proofs with an independent proof checker by reducing the certification problem to pure SAT checks and checking a simple QBF with one quantifier alternation. We also present Certifaiger , the resulting certification toolkit, and evaluate it on instances from the hardware model checking competition. Our experiments show the practical use of our certification method.
Topics & Concepts
Mathematical proofCertificationComputer scienceModel checkingSimple (philosophy)CertificateProgramming languageProof assistantAutomated proof checkingKey (lock)Theoretical computer scienceMathematicsOperating systemLawGeometryEpistemologyPolitical sciencePhilosophyFormal Methods in VerificationSoftware Testing and Debugging TechniquesSecurity and Verification in Computing