Adding nesting structure to words

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

Volumn 4036 LNCS, Issue , 2006, Pages 1-13

  Alur, Rajeev ^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

EID: 33746254890     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11779148_1     Document Type: Conference Paper

References (22)

1. R. Alur, M. Benedikt, K. Etessami, P. Godefroid, T. Reps, and M. Yannakakis. Analysis of recursive state machines. ACM Transactions on Programming Languages and Systems, 27(4):786-818, 2005.
2. R. Alur, S. Chaudhuri, and P. Madhusudan. Automata on nested trees. Under submission, 2006.
3. R. Alur, S. Chaudhuri, and P. Madhusudan. A fixpoint calculus for local and global program flows. In ACM POPL, pages 153-365, 2006.
4. R. Alur, K. Etessami, and P. Madhusudan. A temporal logic of nested calls and returns. In TACAS, LNCS 2988, pages 467-481, 2004.
5. R. Alur, V. Kumar, P. Madhusudan, and M. Viswanathan. Congruences for visibly pushdown languages. In ICALP, LNCS 3580, pages 1102-1114, 2005.
6. R. Alur and P. Madhusudan. Visibly pushdown languages. In ACM STOC, pages 202-211, 2004.
7. T. Ball, R. Majumdar, T.D. Millstein, and S.K. Rajamani. Automatic predicate abstraction of C programs. In AACM PLDI, pages 203-213, 2001.
8. T. Ball and S. Rajamani. Bebop: A symbolic model checker for boolean programs. In SPIN Workshop, LNCS 1885, pages 113-130, 2000.
9. P. Dymond. Input-driven languages are in log n depth. Inf. Process. Lett., 26(5);247-250, 1988.
10. T.A. Henzinger, R. Jhala, R. Majumdar, G.C. Necula, G. Sutre, and W. Weimer. Temporal-safety proofs for systems code. In CAV, LNCS 2404, 526-538, 2002.
11. D.E. Kuuth. A characterization of parenthesis languages. Information and Control, 11(3):269-289, 1967.
12. V. Kumar, P. Madhusudan, and M. Viswanathan. Minimization, learning, and conformance testing of boolean programs. Under submission, 2006.
13. V. Kumar, P. Madhusudan, and M. Viswanathan. Visibly pushdown languages for XML. Technical Report UIUCDCS-R-2006-2704, UIUC, 2006.
14. L. Libkin. Logics for unranked trees: An overview. In ICALP, LNCS 3580, pages 35-50, 2005.
15. C. Löding, P. Madhusudan, and O. Serre. Visibly pushdown games. In FSTTCS, LNCS 3328, pages 408-420, 2004.
16. R. McNaughton. Parenthesis grammars. Journal of the ACM, 14(3):490-500, 1967.
17. F. Neven. Automata, logic, and XML. In CSL, pages 2-26, 2002.
18. T. Reps, S. Horwitz, and S. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In ACM POPL, pages 49-61, 1995.
19. L. Segoufin and V. Vianu, Validating streaming XML documents. In ACM PODS, pages 53-64, 2002.
20. W. Thomas, On logics, tilings, and automata. In ICALP, LNCS 510, pages 441-454, 1991.
21. M.Y. Vardi and P. Wolper, Reasoning about infinite computations. Information and Computation, 115(1):1-37, 1994.
22. B. von Braunmühl and R. Verbeek, Input-driven languages are recognized in log n space. In FCT, LNCS 158, pages 40-51, 1983.