138 search results - page 2 / 28 » Linear Encodings of Bounded LTL Model Checking |
CAV
2005
Springer
13 years 11 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...
TACAS
2005
Springer
13 years 11 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...
TPHOL
2005
IEEE
13 years 11 months ago
2005
IEEE
Using the HOL theorem prover, we proved the correctness of a translation from a subset of Accellera’s property specification language PSL to linear temporal logic LTL. Moreover,...
ICFEM
2009
Springer
13 years 3 months ago
2009
Springer
One of the most important open problems of parallel LTL model-checking is to design an on-the-fly scalable parallel algorithm with linear time complexity. Such an algorithm would g...
LFCS
2007
Springer
13 years 11 months ago
2007
Springer
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...