Languages of nested trees

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

Volumn 4144 LNCS, Issue , 2006, Pages 329-342

  Alur, Rajeev ^a   Chaudhuri, Swarat ^a   Madhusudan, P ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; FINITE AUTOMATA; MATHEMATICAL MODELS; PROBLEM SOLVING; QUERY LANGUAGES; SET THEORY;

BRANCHING BEHAVIORS; MONADIC SECOND ORDER (MSO) LOGIC; NESTED JUMPEDGES; PUSHDOWN PROGRAMS;

TREES (MATHEMATICS);

EID: 33749865109     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11817963_31     Document Type: Conference Paper

References (24)

1. R. Alur, S. Chaudhuri, and P. Madhusudan. A fixpoint calculus for local and global program flows. In Proc. of POPL '06, pp. 153-165, 2006.
2. R. Alur, S. Chaudhuri, and P. Madhusudan. Languages of nested trees. University of Pennsylvania Technical Report MS-CIS-06-10, 2006.
3. R. Alur and P. Madhusudan. Visibly pushdown languages. In Proc. of STOC '04, pp. 202-211, 2004.
4. R. Alur and P. Madhusudan. Adding nesting structure to words. In Proc. of DLT '06, LNCS 4036, pp. 1-13, 2006.
5. T. Ball and S. Rajamani. The SLAM project: debugging system software via static analysis. In Proc. of POPL '02, pp. 1-3, 2002.
6. O. Burkart and B. Steffen. Model checking the full modal mu-calculus for infinite sequential processes. Theoretical Computer Science, 221, pp.251-270, 1999.
7. D. Caucal. On infinite transition graphs having a decidable monadic theory. Theor. Comput. Sci., 290(1), pp.79-115, 2003.
8. H. Comon, M. Dauchet, R. Gilleron, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Draft, 2003.
9. E.A. Emerson and C.S. Jutla. Tree automata, mu-calculus, and determinacy. In Proc. of FOCS '91, pp. 368-377, 1991.
10. E. Grädel, W. Thomas, and T. Wilke, editors. Automata, Logics, and Infinite Games: A Guide to Current Research, LNCS 2500, 2002.
11. T.A. Henzinger, R. Jhala, R. Majumdar, G.G. Necula, G. Sutre, and W. Weimer. Temporal-safety proofs for systems code. CAV '02, LNCS 2404, pp. 526-538, 2002.
12. J.E. Hopcroft and J.D.Ullman. Introduction to automata theory, languages, and computation. Addison-Wesley, 1979.
13. 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, LNCS 1119, pp. 263-277, 1996.
14. D. Kozen. Results on the propositional mu-calculus. Theoretical Computer Science, 27:333-354, 1983.
15. O. Kupferman, N. Piterman, and M.Y. Vardi. Pushdown specifications. In Proc. of LPAR '02, LNCS 2514, pages 262-277. Springer, 2002.
16. C. Löding. Private communication.
17. C. Löding, P. Madhusudan, and O. Serre. Visibly pushdown games. In Proc. of FSTTCS '04, LNCS 3328, pp. 408-420, 2004.
18. K.L. McMillan. Symbolic model checking: an approach to the state explosion problem. Kluwer Academic Publishers, 1993.
19. D. E. Muller and P. E. Schupp. Alternating automata on infinite trees. Theor. Comput. Sci., 54(2-3):267-276, 1987.
20. D.E. Muller and P.E. Schupp. The theory of ends, pushdown automata, and second-order logic. Theoretical Computer Science, 37:51-75, 1985.
21. M.O. Rabin. Decidability of second order theories and automata on infinite trees. Transactions of the AMS, 141:1-35, 1969.
22. T. Reps, S. Horwitz, and S. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In Proc. of POPL '95, pp. 49-61, 1995.
23. I. Walukiewicz. Pushdown processes: Games and model-checking. Information and Computation, 164(2):234-263, 2001.
24. I. Walukiewicz. Monadic second-order logic on tree-like structures. Theor. Comput. Sci., 275(1-2):311-346, 2002.