69 search results - page 1 / 14 » Infinite State Model-Checking of Propositional Dynamic Logic... |
CSL
2006
Springer
13 years 4 months ago
2006
Springer
Model-checking problems for PDL (propositional dynamic logic) and its extension PDL (which includes the intersection operator on programs) over various classes of infinite state sy...
CADE
2007
Springer
14 years 5 months ago
2007
Springer
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...
CADE
2002
Springer
14 years 5 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
CONCUR
2006
Springer
13 years 6 months ago
2006
Springer
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
JAPLL
2006
13 years 4 months ago
2006
This paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with looping, repeat, test, intersection, converse, program complementation as well as context...