51 search results - page 2 / 11 » Simple Bounded LTL Model Checking |
CORR
2006
Springer
13 years 5 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...
ENTCS
2007
13 years 5 months ago
2007
We present a syntactic scheme for translating future-time LTL bounded model checking problems into propositional satisfiability problems. The scheme is similar in principle to th...
HYBRID
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. The use of algorithmic verification and synthesis tools for hybrid systems is currently limited to systems exhibiting simple continuous dynamics such as timed automata o...
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...
TPHOL
2005
IEEE
13 years 10 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,...