27 search results - page 4 / 6 » The Complexity of Games on Higher Order Pushdown Automata |
123
click to vote
FOSSACS
2011
Springer
14 years 3 months ago
2011
Springer
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for tri...
161
click to vote
ILC
2007
Springer
15 years 6 months ago
2007
Springer
Two-way alternating automata were introduced by Vardi in order to study the satisfiability problem for the modal µ-calculus extended with backwards modalities. In this paper, we ...
LMCS
2007
14 years 11 months ago
2007
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
WIA
2000
Springer
15 years 3 months ago
2000
Springer
- Adaptive technologies are based on the self-modifying property of some systems, which give their users a very powerful and convenient facility for expressing and handling complex...
LICS
2006
IEEE
15 years 5 months ago
2006
IEEE
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...