TY - GEN
T1 - Linear completeness thresholds for bounded model checking
AU - Kroening, Daniel
AU - Ouaknine, Joël
AU - Strichman, Ofer
AU - Wahl, Thomas
AU - Worrell, James
N1 - Funding Information: Supported by the EU FP7 STREP PINCETTE.
PY - 2011
Y1 - 2011
N2 - Bounded model checking is a symbolic bug-finding method that examines paths of bounded length for violations of a given LTL formula. Its rapid adoption in industry owes much to advances in SAT technology over the past 10-15 years. More recently, there have been increasing efforts to apply SAT-based methods to unbounded model checking. One such approach is based on computing a completeness threshold: a bound k such that, if no counterexample of length k or less to a given LTL formula is found, then the formula in fact holds over all infinite paths in the model. The key challenge lies in determining sufficiently small completeness thresholds. In this paper, we show that if the Büchi automaton associated with an LTL formula is cliquey, i.e., can be decomposed into clique-shaped strongly connected components, then the associated completeness threshold is linear in the recurrence diameter of the Kripke model under consideration. We moreover establish that all unary temporal logic formulas give rise to cliquey automata, and observe that this group includes a vast range of specifications used in practice, considerably strengthening earlier results, which report manageable thresholds only for elementary formulas of the form Fp and Gq .
AB - Bounded model checking is a symbolic bug-finding method that examines paths of bounded length for violations of a given LTL formula. Its rapid adoption in industry owes much to advances in SAT technology over the past 10-15 years. More recently, there have been increasing efforts to apply SAT-based methods to unbounded model checking. One such approach is based on computing a completeness threshold: a bound k such that, if no counterexample of length k or less to a given LTL formula is found, then the formula in fact holds over all infinite paths in the model. The key challenge lies in determining sufficiently small completeness thresholds. In this paper, we show that if the Büchi automaton associated with an LTL formula is cliquey, i.e., can be decomposed into clique-shaped strongly connected components, then the associated completeness threshold is linear in the recurrence diameter of the Kripke model under consideration. We moreover establish that all unary temporal logic formulas give rise to cliquey automata, and observe that this group includes a vast range of specifications used in practice, considerably strengthening earlier results, which report manageable thresholds only for elementary formulas of the form Fp and Gq .
UR - http://www.scopus.com/inward/record.url?scp=79960374829&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-22110-1_44
DO - 10.1007/978-3-642-22110-1_44
M3 - منشور من مؤتمر
SN - 9783642221095
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 557
EP - 572
BT - Computer Aided Verification - 23rd International Conference, CAV 2011, Proceedings
T2 - 23rd International Conference on Computer Aided Verification, CAV 2011
Y2 - 14 July 2011 through 20 July 2011
ER -