CiteSeerX — Shortest Counterexamples for Symbolic Model Checking of LTL with Past

Shortest Counterexamples for Symbolic Model Checking of LTL with Past (2005) [8 citations — 1 self]

Popular Tags

No tags have been applied to this document.

BibTeX | Add To MetaCart

@INPROCEEDINGS{Schuppan05shortestcounterexamples,
    author = {Viktor Schuppan and Armin Biere},
    title = {Shortest Counterexamples for Symbolic Model Checking of LTL with Past},
    booktitle = {In: TACAS. Volume 3440 of LNCS},
    year = {2005},
    pages = {493--509},
    publisher = {Springer}
}

Bookmarks

OpenURL

Abstract:

Shorter counterexamples are typically easier to understand. The length of a counterexample, as reported by a model checker, depends on both the algorithm used for state space exploration and the way the property is encoded. We provide necessary and sufficient criteria for a B uchi automaton to accept shortest counterexamples. We prove that B uchi automata constructed using the approach of Clarke, Grumberg, and Hamaguchi accept shortest counterexamples of future time LTL formulae, while an automaton generated with the algorithm of Gerth et al. (GPVW) may lead to unnecessary long counterexamples. Optimality is lost in the first case as soon as past time operators are included. Adapting a recently proposed encoding for bounded model checking of LTL with past, we construct a B uchi automaton that accepts shortest counterexamples for full LTL. We use our method of translating liveness into safety to find shortest counterexamples with a BDD-based symbolic model checker without modifying the model checker itself.

Citations

892	Temporal and modal logic – Emerson - 1990
480	Symbolic model checking without BDDs – Biere, Cimatti, et al. - 1999
453	and P.Wolper. An Automata-Theoretic approach to Automatic Program Verification – Vardi - 1986
210	Simple On-the-fly Automatic Verification of Linear Temporal Logic – Gerth, Peled, et al. - 1995
182	Tense Logic and the Theory of Linear Order – Kamp - 1968
117	NuSMV 2: An opensource tool for symbolic model checking – Cimatti
86	Another Look at LTL Model Checking – Clarke, Grumberg, et al. - 1997
75	Efficient Büchi automata from LTL formulae – Somenzi, Bloem - 2000
70	Model checking of safety properties – Kupferman, Vardi - 2001
41	Memory-efficient algorithms for the verification of temporal properties. Formal methods in system design – Courcoubetis, Vardi, et al.
39	Algorithmic Verification of Linear Temporal Logic Specifications – Kersten, Pnueli, et al. - 1998
35	a system for verification and synthesis – VIS - 1996
33	The declarative past and imperative future – Gabbay - 1987
21	Efficient generation of counterexamples and witnesses in symbolic model checking – Clarke, Grumberg, et al. - 1995
17	A comparative study of symbolic algorithms for the computation of fair cycles – Ravi, Bloem, et al. - 2000
17	Pruning techniques for the SAT-based bounded model checking problem – Shtrichman
16	Bounded Model Checking for Past LTL – Benedetti, Cimatti - 2003
16	P.: Temporal logic with forgettable past – Laroussinie, Markey, et al. - 2002
12	A.: Efficient reduction of finite state model checking to reachability analysis – Schuppan, Biere
12	More Deterministic” vs. “Smaller” Büchi Automata for Efficient LTL Model Checking – Sebastiani, Tonetta - 2003
11	F.: Proving more properties with bounded model checking – Awedh, Somenzi
10	Making the most of bmc counterexamples – Groce, Kroening - 2005
8	Bounded verification of past LTL – Cimatti, Roveri, et al. - 2004
8	Minimization of counterexamples in spin – Gastin, Moro, et al. - 2004
7	Improving automata generation for linear temporal logic by considering the automaton hierarchy – Schneider - 2001
6	T.: Simple is better: Efficient bounded model checking for past LTL – Latvala, Biere, et al. - 2005