A type system equivalent to the modal Mu-calculus model checking of higher-order recursion schemes

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2009, Pages 179-188

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

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b TOHOKU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CORRECTNESS PROOFS; GAME SEMANTICS; HIGHER ORDER; MODEL CHECKING PROBLEM; MU-CALCULUS; POLYNOMIAL-TIME; RECURSION SCHEMES; TYPE SYSTEMS; TYPECHECKING; VERIFICATION ALGORITHMS; VERIFICATION METHOD;

CALCULATIONS; COMPUTER SCIENCE;

MODEL CHECKING;

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

References (19)

1. K. Aehlig. A finite semantics of simply-typed lambda terms for infinite runs of automata. Logical Methods in Computer Science, 3(3), 2007.
2. T. Cachat. Higher order pushdown automata, the caucal hierarchy of graphs and parity games. In Proceedings of ICALP 2003, volume 2719 of Lecture Notes in Computer Science, pages 556-569. Springer-Verlag, 2003.
3. T. Cachat and I. Walukiewicz. The complexity of games on higher order pushdown automata. CoRR, abs/0705.0262, 2007.
4. B. Courcelle. The monadic second-order logic of graphs IX: machines and their behaviours. Theoretical Computer Science, 151:125-162, 1995.
5. E. A. Emerson and C. S. Jutla. Tree automata, mu-calculus and determinacy (extended abstract). In FOCS 1991, pages 368-377, 1991.
6. E. Grädel, W. Thomas, and T. Wilke, editors. Automata, Logics, and Infinite Games: A Guide to Current Research, volume 2500 of Lecture Notes in Computer Science. Springer- Verlag, 2002.
7. M. Hague, A. Murawski, C.-H. L. Ong, and O. Serre. Collapsible pushdown automata and recursion schemes. In Proceedings of 23rd Annual IEEE Symposium on Logic in Computer Science (LICS 2008), pages 452-461. IEEE Computer Society, 2008.
8. H. Hosoya, J. Vouillon, and B. C. Pierce. Regular expression types for XML. ACM Trans. Program. Lang. Syst., 27(1):46-90, 2005.
9. J. M. E. Hyland and C.-H. L. Ong. On Full Abstraction for PCF: I. Models, observables and the full abstraction problem, II. Dialogue games and innocent strategies, III. A fully abstract and universal game model. Information and Computation, 163:285-408, 2000.
10. M. Jurdziński. Small progress measures for solving parity games. In Proc. STACS, volume 1770 of Lecture Notes in Computer Science, pages 290-301. Springer-Verlag, 2000.
11. T. Knapik, D. Niwiński, and P. Urzyczyn. Deciding monadic theories of hyperalgebraic trees. In TLCA 2001, volume 2044 of Lecture Notes in Computer Science, pages 253-267. Springer-Verlag, 2001.
12. T. Knapik, D. Niwiński, and P. Urzyczyn. Higher-order pushdown trees are easy. In FoSSaCS 2002, volume 2303 of Lecture Notes in Computer Science, pages 205-222. Springer- Verlag, 2002.
13. N. Kobayashi. Model-checking higher-order functions. Unpublished, 2009.
14. N. Kobayashi. Types and higher-order recursion schemes for verification of higher-order programs. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages (POPL 2009), 2009.
15. N. Kobayashi and C.-H. L. Ong. Complexity of model checking recursion schemes for fragments of the modal mucalculus. In Proceedings of ICALP 2009, Lecture Notes in Computer Science. Springer-Verlag, 2009.
16. M. Naik. A type system equivalent to a model checker. Master Thesis, Purdue University.
17. M. Naik and J. Palsberg. A type system equivalent to a model checker. In ESOP 2005, volume 3444 of Lecture Notes in Computer Science, pages 374-388. Springer-Verlag, 2005.
18. C.-H. L. Ong. On model-checking trees generated by higherorder recursion schemes. In Proceedings of IEEE Symposium on Logic in Computer Science (LICS 2006), pages 81-90. IEEE Computer Society Press, 2006.
19. M. O. Rabin. Decidability of second-order theories and automata on infinite trees. Trans. Amer. Maths. Soc, 141:1-35, 1969.