13 search results - page 1 / 3 » The Complexity of Model Checking (Collapsible) Higher-Order ... |
262
Voted
FSTTCS
2010
Springer
15 years 3 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...
171
click to vote
FOSSACS
2009
Springer
16 years 1 months ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
186
Voted
ESOP
2008
Springer
15 years 8 months ago
2008
Springer
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...
144
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
186
Voted
FOSSACS
2007
Springer
16 years 18 days ago
2007
Springer
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...