Corpus ID: 9886482

A single-instance incremental SAT formulation of proof- and counterexample-based abstraction

  title={A single-instance incremental SAT formulation of proof- and counterexample-based abstraction},
  author={Niklas E{\'e}n and Alan Mishchenko and Nina Amla},
  journal={Formal Methods in Computer Aided Design},
This paper presents an efficient, combined formulation of two widely used abstraction methods for bit-level verification: counterexample-based abstraction (CBA) and proof-based abstraction (PBA). Unlike previous work, this new method is formulated as a single, incremental SAT-problem, interleaving CBA and PBA to develop the abstraction in a bottom-up fashion. It is argued that the new method is simpler conceptually and implementation-wise than previous approaches. As an added bonus, proof… Expand
Core minimization in SAT-based abstraction
This paper analyzes the impact of unsatisfiable core minimization, using state-of-the-art algorithms for the computation of minimally unsatisfiable subformulas (MUSes), on the effectiveness of a hybrid (counterexample-based and proof-based) abstraction engine. Expand
IC3-guided abstraction
Experiments confirm that this approach yields significantly smaller abstractions in many cases, and that the resulting abstract models are often easier to verify. Expand
EPR-based k-induction with Counterexample Guided Abstraction Refinement
An extension of the EPR-based bounded model checking with k-induction which can be used to prove safety properties of systems over unbounded runs and is implemented in a first-order automated theorem prover iProver. Expand
Variable Time-Frame Abstraction
Verification benefits from removing logic that is not relevant for a proof. Techniques for doing this are generally known as localization abstraction. Abstraction is often performed by selecting aExpand
GLA: Gate-level abstraction revisited
This paper shows how a better integration between the BMC engine and the SAT solver is achieved, resulting in a new hybrid abstraction engine, that is faster and uses less memory. Expand
Speeding Up Assumption-Based SAT
This paper explains some deficiencies in this approach that can hinder its efficiency, and provides a very simple modification that fixes these deficiencies, and shows that this modification makes a non-trivial difference in practice, e.g., allowing two tested state of the art MaxSat solvers to solve 50+ new instances. Expand
Ultimately Incremental SAT
This paper proposes a comprehensive solution for incremental SAT solving under assumptions, where SatELite is applied and all the assumptions are propagated, and outperforms existing approaches over publicly available instances generated by a prominent industrial application in hardware validation. Expand
Reducing interpolant circuit size by ad-hoc logic synthesis and SAT-based weakening
Two interpolant compaction techniques are proposed: a set of ad-hoc logic synthesis functions that, revisiting known logic synthesis approaches, specifically address speed and scalability and an interpolant weakening technique, where the UNSAT core extracted from an additional SAT query is used to obtain a gate-level abstraction of the interpolant. Expand
Using Speculation for Sequential Equivalence Checking
An improved method for speculative reduction is proposed and applied to (suspected) hard verification problems. Several variations of the algorithm were tested: (a) applying speculation initially toExpand
A Counterexample-Guided Interpolant Generation Algorithm for SAT-Based Model Checking
A new approach to generate a variety of functionally different interpolants using simulation and SAT solving is proposed and seamlessly integrated the novel interpolant generation algorithm into a reinterpreted interpolation-based model checking procedure. Expand


Iterative Abstraction using SAT-based BMC with Proof Analysis
This work uses the proofanalysis technique with SAT-based BMC, in order to generate effective abstract models and demonstrates the effectiveness of the prototype implementation on several large industry designs. Expand
Combining Abstraction Refinement and SAT-Based Model Checking
It is concluded that when using interpolation-based model checking, measures must be taken to prevent the overhead of abstraction refinement from dominating runtime. Expand
A Hybrid of Counterexample-Based and Proof-Based Abstraction
In a study of a large number of industrial verification problems, it is found that there is a strong relation between the effort applied in the refinement phase and the number of refinement iterations, and proof-based abstraction is substantially more efficient than counterexample- based abstraction. Expand
Automatic Abstraction without Counterexamples
A method of automatic abstraction is presented that uses proofs of unsatisfiability derived from SAT-based bounded model checking as a guide to choosing an abstraction for unbounded model checking.Expand
Efficient Abstraction Refinement in Interpolation-Based Unbounded Model Checking
  • Bing Li, F. Somenzi
  • Mathematics, Computer Science
  • 2006
It is shown that for passing properties abstraction refinement leads to proofs that often require examination of shorter paths, and the techniques developed to minimize such overhead to the point that even for failing properties the abstraction refinement scheme remains competitive. Expand
Interpolation and SAT-Based Model Checking
In benchmark studies using a set of large industrial circuit verification instances, this method is greatly more efficient than BDD-based symbolic model checking, and compares favorably to some recent SAT-based model checking methods on positive instances. Expand
Applying Logic Synthesis for Speeding Up SAT
This paper explores preprocessing of circuit-based SAT problems using recent advances in logic synthesis using DAG-aware logic minimization and a novel type of structural technology mapping, which reduces the size of the CNF derived from the circuit. Expand
Automated Abstraction Refinement for Model Checking Large State Spaces Using SAT Based Conflict Analysis
A SAT based automatic abstraction refinement framework for model checking systems with several thousand state variables in the cone of influence of the specification and a computationally more advantageous approach in which the abstract transition relation is approximated by pre-quantifying invisible variables during image computation. Expand
Formal property verification by abstraction refinement with formal, simulation and hybrid engines
RFN, a formal property verification tool based on abstraction refinement, is developed to verify various properties of real-world RTL designs containing approximately 5,000 registers, which represents an order of magnitude improvement over previous results. Expand
Efficient Circuit to CNF Conversion
This work outlines a simple and expressive data structure for describing arbitrary circuits, as well as an algorithm for converting circuits to CNF, and shows that the CNF problems it generates are consistently smaller and more quickly solved by modern SAT solvers than the C NF problems generated by current CNF generation methods. Expand