Making abstraction-refinement efficient in model checking
From MaRDI portal
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.
Recommendations
Cited in
(9)- An automatic method for the dynamic construction of abstractions of states of a formal model
- Comparing abstraction refinement algorithms
- Abstraction and Refinement in Model Checking
- Automata-Based Abstraction Refinement for µHORS Model Checking
- A type-directed abstraction refinement approach to higher-order model checking
- Correct Hardware Design and Verification Methods
- Tools and Algorithms for the Construction and Analysis of Systems
- The role of abstraction in model checking
- An efficient approach for abstraction-refinement in model checking
This page was built for publication: Making abstraction-refinement efficient in model checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3087967)