Making Abstraction Refinement Efficient in Model Checking

Details Making Abstraction Refinement Efficient in Model Checking Making Abstraction Refinement Efficient in Model Checking

2010-07-21

arxiv.org/abs/1007.3569v1

Computer Science

Logic in Computer Science

14 pages, 10 figures

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, 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.

Affiliated with

Also associated with

No associations

Rating

Making Abstraction Refinement Efficient in 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 Making Abstraction Refinement Efficient in Model Checking, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Making Abstraction Refinement Efficient in Model Checking will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-183361