Corpus ID: 9886482

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

@article{En2010ASI,
  title={A single-instance incremental SAT formulation of proof- and counterexample-based abstraction},
  author={N. E{\'e}n and A. Mishchenko and Nina Amla},
  journal={Formal Methods in Computer Aided Design},
  year={2010},
  pages={181-188}
}
  • N. Eén, A. Mishchenko, Nina Amla
  • Published 2010
  • Computer Science
  • 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… CONTINUE READING
    49 Citations

    Figures, Tables, and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    Core minimization in SAT-based abstraction
    • 9
    • PDF
    IC3-guided abstraction
    • 8
    • PDF
    EPR-based k-induction with Counterexample Guided Abstraction Refinement
    • 4
    • PDF
    GLA: Gate-level abstraction revisited
    • 15
    • PDF
    Speeding Up Assumption-Based SAT
    • 5
    • PDF
    Ultimately Incremental SAT
    • 28
    • PDF
    Reducing interpolant circuit size by ad-hoc logic synthesis and SAT-based weakening
    • 2
    A Counterexample-Guided Interpolant Generation Algorithm for SAT-Based Model Checking
    • 7
    • PDF
    A Counterexample-Guided Interpolant Generation Algorithm for SAT-Based Model Checking
    • 1
    Reducing Interpolant Circuit Size Through SAT-Based Weakening
    • 1

    References

    SHOWING 1-10 OF 19 REFERENCES
    Iterative Abstraction using SAT-based BMC with Proof Analysis
    • 87
    • PDF
    Combining Abstraction Refinement and SAT-Based Model Checking
    • 16
    • PDF
    A Hybrid of Counterexample-Based and Proof-Based Abstraction
    • 34
    Automatic Abstraction without Counterexamples
    • 248
    • PDF
    Efficient Abstraction Refinement in Interpolation-Based Unbounded Model Checking
    • Bing Li, F. Somenzi
    • Mathematics, Computer Science
    • TACAS
    • 2006
    • 22
    • PDF
    Interpolation and SAT-Based Model Checking
    • 871
    • PDF
    Applying Logic Synthesis for Speeding Up SAT
    • 81
    • PDF
    Formal property verification by abstraction refinement with formal, simulation and hybrid engines
    • 86
    • PDF
    Efficient Circuit to CNF Conversion
    • 30
    • PDF