• Mathematics, Computer Science
  • Published in
    Formal Methods in Computer…
    2010

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={Niklas E{\'e}n and Alan Mishchenko and Nina Amla},
  journal={Formal Methods in Computer Aided Design},
  year={2010},
  pages={181-188}
}
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

Figures, Tables, and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 37 CITATIONS

Formal Methods for Industrial Critical Systems

VIEW 11 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Advances in Debug Automation for a Modern Verification Environment

VIEW 21 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Core minimization in SAT-based abstraction

VIEW 4 EXCERPTS
CITES METHODS

Factoring Out Assumptions to Speed Up MUS Extraction

VIEW 8 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

A flexible formal verification framework for industrial scale validation

VIEW 11 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Interpolating Strong Induction

VIEW 1 EXCERPT
CITES BACKGROUND

Strong Induction in Hardware Model Checking

VIEW 1 EXCERPT
CITES BACKGROUND

A Symbolic Approach to Safety ltl Synthesis

VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.