Recursion schemes and logical reflection

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2010, Pages 120-129

  Broadbent, Christopher H ^a   Carayol, Arnaud ^b   Ong, C H Luke ^a   Serre, Olivier ^c  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITÉ PARIS EST   (France)

^c UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CALCULATIONS; COMPUTER CIRCUITS; ROBOTS; TEMPORAL LOGIC;

COMPUTATION TREES; CORRECTNESS PROPERTIES; LOGICAL LANGUAGE; MODAL MU CALCULUS; MONADIC SECOND-ORDER LOGIC; PUSH-DOWN AUTOMATA; RECURSION SCHEMES; TRANSITION GRAPHS;

FORESTRY;

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

References (21)

1. J. Bradfield and C. Stirling. Modal logics and mu-calculi. In Handbook of Process Algebra, pages 293-332. Elsevier, North-Holland, 2001.
2. C. Broadbent, A. Carayol, C.-H. L. Ong, and O. Serre. Recursion schemes and logical reflection. Preprint, 2010. www.liafa.jussieu.fr/~serre.
3. C. Broadbent and C.-H. L. Ong. On global model checking trees generated by higher-order recursion schemes. In Proc. of FoSSaCS 2009, pages 107-121, 2009.
4. A. Carayol, M. Hague, A. Meyer, C.-H. L. Ong, and O. Serre. Winning regions of higher-order pushdown games. In Proc. of LICS'08, pages 193-204. IEEE, 2008.
5. D. Caucal. On infinite terms having a decidable monadic theory. In Proc. of MFCS'02, pages 165-176, 2002.
6. B. Courcelle. Monadic second-order definable graph transductions: A survey. TCS, 126(1):53-75, 1994.
7. B. Courcelle. The monadic second-order logic of graphs IX: machines and their behaviours. TCS, 151:125-162, 1995.
8. E.A. Emerson and C.S. Jutla. Tree automata, mu-calculus and determinacy. In Proc. of FoCS'91, pages 368-377.
9. M. Hague, A. S. Murawski, C.-H. L. Ong, and O. Serre. Collapsible pushdown automata and recursion schemes. In Proc. of LICS'08, pages 452-461. IEEE, 2008.
10. D. Janin and I. Walukiewicz. On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic. In Proc. of Concur'96, pp. 263-277. 1996.
11. A. Kartzow. Collapsible pushdown graphs of level 2 are tree-automatic. In Proc. of STACS 2010, pp. 501-512. 2010.
12. T. Knapik, D. Niwiński, and P. Urzyczyn. Higher-order pushdown trees are easy. In Proc. of FoSSaCS02, pp 205-222.
13. T. Knapik, D. Niwiński, P. Urzyczyn, and I. Walukiewicz. Unsafe grammars and panic automata. In Proc. of ICALP'05, volume 3580 of LNCS, pages 1450-1461. Springer, 2005.
14. D.A. Martin. Borel determinacy. Annals of Mathematics, 102(363-371), 1975.
15. J. de Miranda. Structures generated by higher-order grammars and the safety constraint. Ph.D. dissertation, University of Oxford, 2006.
16. C.-H. L. Ong. On model-checking trees generated by higher-order recursion schemes. In Proc. of LICS'06, pages 81-90.
17. M. O. Rabin. Decidability of second-order theories and automata on infinite trees. Trans. AMS, 141:1-35, 1969.
18. O. Serre Note on winning positions on pushdown games with omega-regular winning conditions. IPL, 85:285-291, 2003.
19. C. Stirling. Dependency tree automata. In Proc. of FoSSaCS09, pp 92-106.
20. Wolfgang Thomas. Languages, automata, and logic. In Handbook of Formal Language Theory, volume III, pages 389-455. Springer, 1997.
21. M. Y. Vardi and N. Piterman. Global model-checking of infinite-state systems. In Proc. of CAV 2004, pages 387-400.