Detecting Spurious Counterexamples Efficiently in Abstract Model Checking

Details Detecting Spurious Counterexamples Efficiently in Abstract Model Checking Detecting Spurious Counterexamples Efficiently in Abstract Model Checking

2011-09-26

arxiv.org/abs/1109.5506v1

Computer Science

Logic in Computer Science

13 pages,6 figures. arXiv admin note: substantial text overlap with arXiv:1007.3569

Scientific paper

Abstraction is one of the most important strategies for dealing with the state space explosion problem in model checking. In the abstract model, the state space is largely reduced, however, a counterexample found in such a model may not be a real counterexample in the concrete model. Accordingly, the abstract model needs to be further refined. How to check whether or not a reported counterexample is spurious is a key problem in the abstraction-refinement loop. In this paper, a formal definition for spurious path is given. Based on it, efficient algorithms for detecting spurious counterexamples are proposed.

Affiliated with

Also associated with

No associations

Rating

Detecting Spurious Counterexamples Efficiently in Abstract Model Checking does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Detecting Spurious Counterexamples Efficiently in Abstract Model Checking, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Detecting Spurious Counterexamples Efficiently in Abstract Model Checking will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-688835