A game-based framework for CTL counterexamples and 3-valued abstraction-refinement

A game-based framework for CTL counterexamples and 3-valued abstraction-refinement (2003)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Sharon Shoham , Orna Grumberg

Venue:	In Computer Aided Verification (CAV), LNCS 2725
Citations:	20 - 6 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	A game-based framework for CTL counterexamples and 3-valued abstraction-refinement	INFERENCE
AUTHOR NAME	Sharon Shoham	SVM HeaderParse 0.2
AUTHOR AFFIL	Computer Science Department, Technion, Haifa, Israel,	SVM HeaderParse 0.2
AUTHOR NAME	Orna Grumberg	SVM HeaderParse 0.2
AUTHOR AFFIL	Computer Science Department, Technion, Haifa, Israel,	SVM HeaderParse 0.2
ABSTRACT	Abstract. This work exploits and extends the game-based framework of CTL model checking for counterexample and incremental abstraction-refinement. We define a game-based CTL model checking for abstract models over the 3-valued semantics, which can be used for verification as well as refutation. The model checking may end with an indefinite result, in which case we suggest a new notion of refinement, which eliminates indefinite results of the model checking. This provides an iterative abstraction-refinement framework. It is enhanced by an incremental algorithm, where refinement is applied only where indefinite results exist and definite results from prior iterations are used within the model checking algorithm. We also define the notion of annotated counterexamples, which are sufficient and minimal counterexamples for full CTL. We present an algorithm that uses the game board of the model checking game to derive an annotated counterexample in case the examined system model refutes the checked formula. 1	SVM HeaderParse 0.2
YEAR	2003	INFERENCE
VENUE	In Computer Aided Verification (CAV), LNCS 2725	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	275--287	INFERENCE
VOLUME	2725	INFERENCE
CITATIONS	32 found	ParsCit 1.0