2008 · 19 citations · 10 references
ComputingComputer ScienceAlgorithmsFormal MethodsTheory Of ComputationAutomated ReasoningDeductive VerificationEquivalence CheckingModel CheckingTheorem ProvingVerificationAbstract Model CheckingAbstractionAbstraction RefinementCraig InterpolationInterpolation-based VerificationModel RefinementRefinementTest Adequacy
This paper addresses the field of unbounded model checking (UMC) based on SAT engines, where Craig interpolants have recently gained wide acceptance as an automated abstraction technique. We start from the observation that interpolants can be quite effective on large verification instances. As they operate on SAT-generated refutation proofs, interpolants are very good at automatically abstract facts that are not significant for proofs. In this work, we push forward the new idea of generating abstractions without resorting to SAT proofs, and to accept (reject) abstractions whenever they (do not) fulfill given adequacy constraints. We propose an integrated approach smoothly combining the capabilities of interpolation with abstraction and over-approximation techniques, that do not directly derive from SAT refutation proofs. The driving idea of this combination is to incrementally generate, by refinement, an abstract (over-approximate) image, built up from equivalences, implications, ternary and localization abstraction, then (eventually) from SAT refutation proofs. Experimental results, derived from the verification of hard problems, show the robustness of our approach.
10
Graph-Based Algorithms for Boolean Function Manipulation
Bryant · IEEE Transactions on Computers · 1986 · 8.9K citations · Full text
DAG-aware circuit compression for formal verification
Per Bjesse, Arne Borälv · 2005 · 94 citations