SAT-based counterexample-guided abstraction refinement

@article{Clarke2004SATbasedCA,
  title={SAT-based counterexample-guided abstraction refinement},
  author={Edmund M. Clarke and Anubhav Gupta and Ofer Strichman},
  journal={IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems},
  year={2004},
  volume={23},
  pages={1113-1123}
}
We describe new techniques for model checking in the counterexample-guided abstraction-refinement framework. The abstraction phase "hides" the logic of various variables, hence considering them as inputs. This type of abstraction may lead to "spurious" counterexamples, i.e., traces that cannot be simulated on the original (concrete) machine. We check whether a counterexample is real or spurious with a satisfiability (SAT) checker. We then use a combination of 0-1 integer linear programming and… CONTINUE READING
Highly Cited
This paper has 23 citations. REVIEW CITATIONS
16 Citations
22 References
Similar Papers

Citations

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

References

Publications referenced by this paper.
Showing 1-10 of 22 references

PBS: A backtrack-search psuedo-Boolean solver and optimizer

  • F. A. Aloul, A. Ramani, I. L. Markov, K. A. Sakallah
  • Fifth Int. Symp. Theory Applicat. Satisfiability…
  • 2002
Highly Influential
8 Excerpts

Using combinatorial optimization algorithms for efficient image computation

  • P. Chauhan, E. M. Clarke, S. Jha, J. Kukula, H. Veith, D. Wang
  • Proc. Correct Hardware Design and Verification…
  • 2001
1 Excerpt

Similar Papers

Loading similar papers…