Paul Gastin, Pierre Moro, and Marc Zeitoun LIAFA, Univ. of Paris 7, Case...  Home/Search
Context Related
| spinroot.com/spin/Wo...020spin2004.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: spinroot.com/spin/W...program2004 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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... (Update)
Cited by: More
Counterexample Minimization for ACTL ShengYu Shen - Ying Qin And (Correct)
Minimizing Counterexample - With Unit Core (Correct)
Shortest Counterexamples for Symbolic Model Checking of LTL.. - Schuppan, Biere (2005) (Correct)
Active bibliography (related documents): More All
0.3: On Translating Linear Temporal Logic into Alternating and.. - Tauriainen (2003) (Correct)
0.3: Experiments with Deterministic ω-Automata for Formulas.. - Klein, Baier (2005) (Correct)
0.2: Robot Motion Control from a Visual Memory - Remazeilles, Chaumette, Gros (2004) (Correct)
Similar documents based on text: More All
0.3: A Truly Concurrent Semantics for a Simple Parallel.. - Gastin, Mislove (1999) (Correct)
0.3: Characterization of the Expressive Power of Silent.. - Bérard, Diekert.. (1998) (Correct)
0.3: An expressively complete temporal logic without past tense.. - Diekert, Gastin (1999) (Correct)
Related documents from co-citation: More All
3: Minimal assignments for bounded model checking (context) - Ravi, Somenzi - 2004
2: Symbolic model checking without BDDs - Biere, Cimatti et al. - 1999
2: Shortest counterexamples for symbolic model checking of LTL with past - Schuppan, Biere - 2005
BibTeX entry: (Update)
P. Gastin, P. Moro, and M. Zeitoun. Minimization of counterexamples in spin. In SPIN Workshop on Model Checking of Software, pages 92-108, 2004. http://citeseer.ist.psu.edu/gastin04minimization.html More
@misc{ gastin04minimization,
author = "P. Gastin and P. Moro and M. Zeitoun",
title = "Minimization of counterexamples in spin",
text = "P. Gastin, P. Moro, and M. Zeitoun. Minimization of counterexamples in
spin. In SPIN Workshop on Model Checking of Software, pages 92-108, 2004.",
year = "2004",
url = "citeseer.ist.psu.edu/gastin04minimization.html" }
Citations (may not include all citations):828 Model checking - Clarke, Grumberg et al. - 1999
434 An automata-theoretic approach to automatic program verifica.. (context) - Vardi, Wolper - 1986
94 Counterexample-guided abstraction refinement - Clarke, Grumberg et al. - 2001
94 Counterexample-guided abstraction refinement for symbolic mo.. - Clarke, Grumberg et al. - 2003
88 Lazy abstraction - Henzinger, Jhala et al. - 2002
85 Special issue on Formal Methods in Software Practice (context) - Holzmann, checker et al. - 1997
43 The SPIN model-checker (context) - Holzmann - 2003
38 On nested depth first search - Holzmann, Peled et al. - 1996
11 cient algorithms for the verification of temporal properties (context) - Courcoubetis, Vardi et al. - 1991
5 McGraw-Hill Higher Education (context) - Cormen, Stein et al. - 2001
3 Fast LTL to Bchi automata translation (context) - Gastin, Oddoux - 2001
Documents on the same site (http://spinroot.com/spin/Workshops/ws04/program2004.html): More
Model checking of UML models via a mapping to communicating.. - Ober, Graf, Ober (2004) (Correct)
Formal Analysis of Processor Timing Models - Wilhelm (Correct)
IF Validation Environment Tutorial - Bozga, Graf, Mounier, Ober (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC