4 search results - page 1 / 1 » Shortest Counterexamples for Symbolic Model Checking of LTL ... |
TACAS
2005
Springer
13 years 10 months ago
2005
Springer
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 explo...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
Abstract. We consider the problem of bounded model checking (BMC) for linear temporal logic (LTL). We present several efficient encodings that have size linear in the bound. Furthe...
POPL
2011
ACM
12 years 7 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
CAV
2005
Springer
13 years 10 months ago
2005
Springer
Bounded model checking is an efficient method for finding bugs in system designs. The major drawback of the basic method is that it cannot prove properties, only disprove them. R...