309 search results - page 23 / 62 » Model Checking Games for Branching Time Logics |
CSL
2008
Springer
15 years 1 months ago
2008
Springer
We present a game-based semantic framework in which the time complexity of any IMELL proof can be read out of its interpretation. This gives a compositional view of the geometry of...
123
Voted
ERSHOV
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We address model checking problem for combination of Computation Tree Logic (CTL) and Propositional Logic of Knowledge (PLK) in finite systems with the perfect recall syn...
SOFSEM
2007
Springer
15 years 5 months ago
2007
Springer
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...
173
click to vote
FSTTCS
2010
Springer
14 years 9 months ago
2010
Springer
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
TACAS
2005
Springer
15 years 5 months ago
2005
Springer
We present MC2 , what we believe to be the first randomized, Monte Carlo algorithm for temporal-logic model checking, the classical problem of deciding whether or not a property s...