DocumentCode :
1687230
Title :
Counterexample-guided abstraction refinement
Author :
Clarke, Edmund
Author_Institution :
Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
fYear :
2003
Firstpage :
7
Lastpage :
8
Abstract :
The main practical problem in model checking is the combinatorial explosion of system states commonly known as the state explosion problem. Abstraction methods attempt to reduce the size of the state space by employing knowledge about the system and the specification in order to model only relevant features in the Kripke structure. Counterexample-guided abstraction refinement is an automatic abstraction method where, starting with a relatively small skeletal representation of the system to be verified, increasingly precise abstract representations of the system are computed. The key step is to extract information from false negatives ("spurious counterexamples") due to over-approximation.
Keywords :
formal specification; state-space methods; Kripke structure; automatic abstraction method; counterexample-guided abstraction refinement; model checking; spurious counterexamples; state explosion problem; state space; Boolean functions; Collaboration; Computer science; Concrete; Contracts; Data mining; Data structures; Explosions; State-space methods; US Department of Defense;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings. 10th International Symposium on
ISSN :
1530-1311
Print_ISBN :
0-7695-1912-1
Type :
conf
DOI :
10.1109/TIME.2003.1214874
Filename :
1214874
Link To Document :
بازگشت