Edmund Clarke, Daniel Kroening, Joël Ouaknine, Ofer Strichman  Home/Search
Context Related
| cmu.edu/~emc/paper...odel%20checking.ps 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: cmu.edu/~emc/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: For every nite model M and property ', there exists a number CT (the Completeness Threshold) such that if there is no counterexample to ' in M of length CT or less, then M j= '. Finding this number, if it is suciently small, o ers a practical method for making Bounded Model Checking complete. We describe how to compute an over-approximation to CT for a general LTL property using Buchi automaton, following the Vardi-Wolper LTL model checking framework. (Update)
Similar documents based on text:
4.0: Unknown - (Correct)
BibTeX entry: (Update)
Ed Clarke, Daniel Kroening, Joel Ouaknine, and Ofer Strichman. Completeness and complexity of bounded model checking. 2004. To appear. http://citeseer.ist.psu.edu/clarke04completeness.html More
@misc{ clarke04completeness,
author = "E. Clarke and D. Kroening and J. el and O. Ofer",
title = "Completeness and complexity of bounded model checking",
text = "Ed Clarke, Daniel Kroening, Joel Ouaknine, and Ofer Strichman. Completeness
and complexity of bounded model checking. 2004. To appear.",
year = "2004",
url = "citeseer.ist.psu.edu/clarke04completeness.html" }
Citations (may not include all citations):1180 The Temporal Logic of Reactive and Concurrent Systems: Speci.. (context) - Manna, Pnueli - 1991
434 An automata-theoretic approach to automatic program veri cat.. (context) - Vardi, Wolper - 1986
244 Symbolic model checking without BDDs - Biere, Cimatti et al. - 1999
163 the temporal analysis of fairness (context) - Gabbay, Pnueli et al. - 1980
84 Another look at ltl model checking - Clarke, Grumberg et al. - 1994
34 automatic veri - cation of linear temporal logic (context) - Gerth, Peled et al. - 1995
30 Lazy theorem proving for bounded model checking over in nite.. - de Moura, Rue et al. - 2002
19 uchi automata from LTL formulae (context) - Somenzi, Bloem - 2000
12 Property checking via structural analysis - Baumgartner, Kuehlmann et al. - 2002
11 On nested depth rst search (context) - Holzmann, Peled et al. - 1996
10 Improving the encoding of LTL model checking into SAT - Cimatti, Pistore et al. - 2002
6 SAT-based sequential depth computation (context) - Mneimneh, Sakallah - 2002
5 volume 58 of Advances in computers (context) - Biere, Cimatti et al. - 2003
3 Ecient computation of recurrence diameters (context) - Kroening, Strichman - 2003
Documents on the same site (http://www.cs.cmu.edu/~emc/papers.htm): More
Hybrid Spectral Transform Diagrams - Clarke, Fujita, Heinle (1997) (Correct)
Another Look at LTL Model Checking - Clarke, Grumberg, Hamaguchi (1994) (Correct)
Verification of the Futurebus+ Cache Coherence Protocol - Clarke, Grumberg.. (1992) (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