Sciweavers

10 search results - page 2 / 2
» Winning Regions of Higher-Order Pushdown Games
Sort
View
CONCUR
2009
Springer
13 years 11 months ago
Winning Regions of Pushdown Parity Games: A Saturation Method
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...
Matthew Hague, C.-H. Luke Ong
IJFCS
2008
158views more  IJFCS 2008»
13 years 4 months ago
An Alternative Construction in Symbolic Reachability Analysis of Second Order Pushdown Systems
Abstract. Recently, it has been shown that for any higher order pushdown system H and for any regular set C of configurations, the set pre H(C), is regular. In this paper, we give ...
Anil Seth
ATVA
2006
Springer
106views Hardware» more  ATVA 2006»
13 years 8 months ago
Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains
Motivated by recent applications of pushdown systems to computer security problems, we present an efficient algorithm for the reachability problem of alternating pushdown systems. ...
Dejvuth Suwimonteerabuth, Stefan Schwoon, Javier E...
SPIN
2010
Springer
13 years 3 months ago
Analysing Mu-Calculus Properties of Pushdown Systems
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...
Matthew Hague, C.-H. Luke Ong
LICS
2008
IEEE
13 years 11 months ago
Reachability Games and Game Semantics: Comparing Nondeterministic Programs
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...
Andrzej S. Murawski