Minimization of counterexamples in SPIN (2004)
| Venue: | In SPIN Workshop on Model Checking of Software |
BibTeX
@INPROCEEDINGS{Pierre04minimizationof,
author = {Paul Gastin Pierre and Pierre Moro and Marc Zeitoun},
title = {Minimization of counterexamples in SPIN},
booktitle = {In SPIN Workshop on Model Checking of Software},
year = {2004},
pages = {92--108},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We propose an algorithm to find a counterexample to some property in a finite state program. This algorithm is derived from SPIN's one, but it finds a counterexample faster than SPIN does. In particular it still works in linear time. Compared with SPIN's algorithm, it requires only one additional bit per state stored. We further propose another algorithm to compute a counterexample of minimal size. Again, this algorithm does not use more memory than SPIN does to approximate a minimal counterexample. The cost to find a counterexample of minimal size is that one has to revisit more states than SPIN. We provide an implementation and discuss experimental results.
Citations
| 2026 | Model Checking - Clarke, Grumberg, et al. - 2000 |
| 1130 | The model checker SPIN - Holzmann - 1997 |
| 510 | P.: An automata-theoretic approach to automatic program verification - Vardi, Wolper - 1986 |
| 482 | Counterexample-Guided Abstraction Refinement for Symbolic Model Checking - Clarke, Grumberg, et al. - 2003 |
| 378 | G.: Lazy abstraction - Henzinger, Jhala, et al. - 2002 |
| 106 | M.: Memory efficient algorithms for the verification of temporal properties - Courcoubetis, Vardi, et al. - 1992 |
| 92 | Introduction to Algorithms. McGraw-Hill Higher Education - Cormen, Stein, et al. - 2001 |
| 90 | Fast LTL to Büchi automata translation - Gastin, Oddoux |
| 59 | On nested depth-first search - Holzmann, Peled, et al. - 1996 |
| 13 | On-the-fly model checking - Holzmann - 1996 |
