Counterexample-Guided Choice of Projections in Approximate Symbolic Model Checking

  title={Counterexample-Guided Choice of Projections in Approximate Symbolic Model Checking},
  author={Shankar G. Govindaraju and David L. Dill},
BDD-based symbolic techniques of approximate reachability analysis based on decomposing the circuit into a collection of overlapping sub-machines (also referred to as overlapping projections) have been recently proposed. Computing a superset of the reachable states in this fashion is susceptible to false negatives. Searching for real counterexamples in such an approximate space is liable to failure. In this paper, the "hybridization effect" induced by the choice of projections is identified as… CONTINUE READING
Highly Cited
This paper has 48 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-10 of 29 extracted citations

Tools and Algorithms for the Construction and Analysis of Systems

Lecture Notes in Computer Science • 2003
View 11 Excerpts
Highly Influenced

Making CEGAR More Efficient in Software Model Checking

IEEE Transactions on Software Engineering • 2014
View 1 Excerpt

Detecting spurious counterexamples efficiently in abstract model checking

2013 35th International Conference on Software Engineering (ICSE) • 2013
View 1 Excerpt

Similar Papers

Loading similar papers…