2291 search results - page 131 / 459 » Logic Programming and Model Checking |
101
click to vote
ECOOP
2004
Springer
15 years 8 months ago
2004
Springer
Today’s mainstream object-oriented compilers and tools do not support declaring and statically checking simple pre- and postconditions on methods and invariants on object represe...
149
Voted
CONCUR
1997
Springer
15 years 6 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...
124
Voted
CORR
2008
Springer
15 years 2 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...
127
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the se...
132
Voted
TOCL
2011
14 years 9 months ago
2011
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the s...