On model-checking trees generated by higher-order recursion schemes

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2006, Pages 81-90

  Ong, C H L ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

RECURSION SCHEMES; SUCCINCTNESS PROPERTY; TRANSFERENCE PRINCIPLE; TRAVERSAL-TREE;

COMPUTATIONAL METHODS; COMPUTER SIMULATION; LARGE SCALE SYSTEMS; MODEL CHECKING; PROBLEM SOLVING; SEMANTICS;

TREES (MATHEMATICS);

EID: 34547348202     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2006.38     Document Type: Conference Paper

References (15)

1. K. Aehlig, J. G. de Miranda, and C.-H. L. Ong. Safety is not a restriction at level 2 for string languages. In Proc. FOS-SACS'05, pp. 490-501, 2005. LNCS 3411
2. K. Aehlig, J. G. de Miranda, and C.-H. L. Ong. The monadic second order theory of trees given by arbitrary level two recursion schemes is decidable. In Proc. TLCA'05, pp. 39-54, 2005. LNCS 3461
3. K. Aehlig. A finite semantics of simply-typed lambda terms for infinite runs of automata. Submitted. 2006
4. T. Cachat. Higher order pushdown automata, the Caucal hierarchy of graphs and parity games. In Proc. ICALP'03, pp. 556-569, 2003. LNCS 2719
5. D. Caucal. On infinite transition graphs having a decidable monadic theory. In Proc. ICALP'96, pp. 194-205. 1996.
6. D. Caucal. On infinite terms having a decidable monadic theory. In Proc. MFCS'02, pp. 165-176, 2002. LNCS 2420
7. E. A. Emerson and C. S. Jutla. Tree automata, mu-calculus and determinacy. In Proc. FOCS'91, pp. 368-377, 1991.
8. E. A. Emerson and C. Lei. Efficient model checking in fragments of propositional mu-calculus. In Proc. LICS'86, pp. 267-278, 1986.
9. J. M. E. Hyland and C.-H. L. Ong. On Full Abstraction for PCF: I, II & III. Info. & Comp., 163:285-408, 2000.
10. M. Jurdziński. Small progress measures for solving parity games. In Proc. STACS, pp. 290-301, 2000. LNCS 1770
11. T. Knapik, D. Niwiński, and P. Urzyczyn. Higher-order pushdown trees are easy. In Proc. FOSSACS'02, pp. 205-222, 2002. LNCS Vol. 2303
12. T. Knapik, D. Niwiński, P. Urzyczyn, and I. Walukiewicz. Unsafe grammars and panic automata. In Proc. ICALP'05, pp. 1450-1461. 2005. LNCS 3580
13. D. E. Muller and P. E. Schupp. The theory of ends, pushdown automata, and second-order logic. TCS, 37:51-75, 1985.
14. C.-H. L. Ong. On model-checking trees generated by higher-order recursion schemes. Preprint, 42 pp. 2006. http://users.comlab.ox.ac.uk/luke.ong/ publications/ntrees.ps
15. C. Stirling. A game-theoretic approach to deciding higher-order matching. In Proc. ICALP06, LNCS, 2006. To appear.