Sciweavers

3 search results - page 1 / 1
» Parametrized Regular Infinite Games and Higher-Order Pushdow...
Sort
View
FCT
2009
Springer
13 years 7 months ago
Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies
Given a set P of natural numbers, we consider infinite games where the winning condition is a regular -language parametrized by P. In this context, an -word, representing a play, h...
Paul Hänsch, Michaela Slaats, Wolfgang Thomas
ESOP
2008
Springer
13 years 5 months ago
Verification of Higher-Order Computation: A Game-Semantic Approach
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
C.-H. Luke Ong
IJFCS
2008
158views more  IJFCS 2008»
13 years 3 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