493 search results - page 47 / 99 » Bounded LTL Model Checking with Stable Models |
FMSD
2006
15 years 2 months ago
2006
We propose a refinement approach to language emptiness, which is based on the enumeration and the successive refinements of SCCs on over-approximations of the exact system. Our alg...
151
click to vote
CONCUR
1997
Springer
15 years 7 months ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
127
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic t...
116
click to vote
CAV
2003
Springer
15 years 8 months ago
2003
Springer
Run-time monitoring of temporal properties and assertions is used for testing and as a component of execution-based model checking techniques. Traditional run-time monitoring howev...
131
click to vote
ENTCS
2010
15 years 8 days ago
2010
We present MLSolver, a tool for solving the satisfiability and validity problems for modal fixpoint logics. The underlying technique is based on characterisations of satisfiabilit...