English

Making Abstraction Refinement Efficient in Model Checking

Logic in Computer Science 2010-07-27 v1

Abstract

Abstraction is one of the most important strategies for dealing with the state space explosion problem in model checking. In the abstract model, although the state space is largely reduced, however, a counterexample found in such a model may not be a real counterexample. And the abstract model needs to be further refined where an NP-hard state separation problem is often involved. In this paper, a novel method is presented by adding extra variables to the abstract model for the refinement. With this method, not only the NP-hard state separation problem is avoided, but also a smaller refined abstract model is obtained.

Keywords

Cite

@article{arxiv.1007.3569,
  title  = {Making Abstraction Refinement Efficient in Model Checking},
  author = {Cong Tian and Zhenhua Duan},
  journal= {arXiv preprint arXiv:1007.3569},
  year   = {2010}
}

Comments

14 pages, 10 figures

R2 v1 2026-06-21T15:50:46.922Z