97 search results - page 7 / 20 » Visibly Pushdown Games |
ATVA
2006
Springer
14 years 2 months ago
2006
Springer
Motivated by recent applications of pushdown systems to computer security problems, we present an efficient algorithm for the reachability problem of alternating pushdown systems. ...
CONCUR
2009
Springer
14 years 5 months ago
2009
Springer
We present a new algorithm for computing the winning region of a parity game played over the configuration graph of a pushdown system. Our method gives the first extension of the...
SPIN
2010
Springer
13 years 8 months ago
2010
Springer
Pushdown systems provide a natural model of software with recursive procedure calls. We provide a tool implementing an algorithm for computing the winning regions of a pushdown par...
POPL
2006
ACM
14 years 10 months ago
2006
ACM
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
ndence fails. In the conclusion we address the question of an abstract criterion that explains the results.