1724 search results - page 34 / 345 » Types as models: model checking message-passing programs |
POPL
1992
ACM
13 years 11 months ago
1992
ACM
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
Abstract A new unfolding approach to LTL model checking is presented, in which the model checking problem can be solved by direct inspection of a certain finite prefix. The techniq...
JAPLL
2006
13 years 7 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...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
For concurrent probabilistic programs having process-level nondeterminism, it is often necessary to restrict the class of schedulers that resolve nondeterminism to obtain sound an...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
This paper presents complexity results for model checking concurrent programs against temporal-epistemic formulae. We apply these results to evaluate the complexity of verifying p...