Complexity of model checking recursion schemes for fragments of the modal Mu-calculus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5556 LNCS, Issue PART 2, 2009, Pages 223-234

  Kobayashi, Naoki ^a   Ong, C H Luke ^b  

^a TOHOKU UNIVERSITY   (Japan)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONAL PROGRAMS; MODEL CHECKING PROBLEM; MU-CALCULUS; PARITY TREE AUTOMATA; RECURSION SCHEMES; RESOURCE USAGE; TRANSITION FUNCTIONS; VERIFICATION PROBLEMS;

AUTOMATA THEORY; CALCULATIONS; LINGUISTICS; ROBOTS; TRANSLATION (LANGUAGES);

MODEL CHECKING;

EID: 70449124302     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02930-1_19     Document Type: Conference Paper

References (9)

1. Ong, C.-H.L.: On model-checking trees generated by higher-order recursion schemes. In: LICS 2006, pp. 81-90. IEEE Computer Society Press, Los Alamitos (2006)
2. Kobayashi, N.: Types and higher-order recursion schemes for verification of higher-order programs. In: Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages, pp. 416-428 (2009)
3. Igarashi, A., Kobayashi, N.: Resource usage analysis. ACM Transactions on Programming Languages and Systems 27(2), 264-313 (2005)
4. Aehlig, K.: A finite semantics of simply-typed lambda terms for infinite runs of automata. Logical Methods in Computer Science 3(3) (2007)
5. Engelfriet, J.: Iterated stack automata and complexity classes. Information and Computation 95(1), 21-75 (1991)
6. Kobayashi, N., Ong, C.-H.L.: A type system equivalent to the modal mu-calculus model checking of higher-order recursion schemes. In: Proceedings of LICS 2009 (2009)
7. Kobayashi, N., Ong, C.-H.L.: Complexity of model checking recursion schemes for fragments of the modal mu-calculus. A long version, available from the authors' web page (2009)
8. Knapik, T., Niwiński, D., Urzyczyn, P.: Higher-order pushdown trees are easy. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol. 2303, pp. 205-222. Springer, Heidelberg (2002)
9. Janin, D., Walukiewicz, I.: Automata for the modal mu-calculus and related results. In: Hájek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol. 969, pp. 552-562. Springer, Heidelberg (1995)