Adding nesting structure to words

Journal of the ACM

Volumn 56, Issue 3, 2009, Pages

  Alur, Rajeev ^a   Madhusudan, P ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

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

Author keywords

Pushdown automata; Software model checking; Tree automata; XML processing

Indexed keywords

ALGORITHMIC VERIFICATION; BOTTOM-UP AND TOP-DOWN; CLOSURE PROPERTY; COMPLEMENTATION; DECISION PROBLEMS; DEFINABILITY; ENCODINGS; FINITE-STATE; HIERARCHICAL STRUCTURES; LINEAR ORDERINGS; LINGUISTIC DATA; MONADIC SECOND-ORDER LOGIC; ORDERED TREE; PUSHDOWN AUTOMATA; REGULAR LANGUAGES; SOFTWARE MODEL CHECKING; SPECIFICATION LOGIC; STACK INSPECTION; TREE AUTOMATA; TREE OPERATIONS; VISIBLY PUSHDOWN LANGUAGES; WORD AUTOMATA; WORD LANGUAGES; XML PROCESSING;

ALGORITHMIC LANGUAGES; AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; COMPUTER SOFTWARE; EQUIVALENCE CLASSES; LINGUISTICS; MARKUP LANGUAGES; MODEL CHECKING; QUERY LANGUAGES; ROBOTS; SET THEORY; TRANSLATION (LANGUAGES); XML;

CONTEXT FREE LANGUAGES;

EID: 69149105622     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1516512.1516518     Document Type: Article

References (48)

1. Alur, R. 2007. Marrying words and trees. In Proceedings of the 26th ACM Symposium on Principles of Database Systems. ACM, New York, 233-242.
2. Alur, R., Benedikt, M., Etessami, K., Godefroid, P., Reps, T., and Yannakakis, M. 2005a. Analysis of recursive state machines. ACM Trans. Prog. Lang. Syst. 27, 4, 786-818.
3. Alur, R., Etessami, K., and Madhusudan, P. 2004. A temporal logic of nested calls and returns. In TACAS'04: Proceedings of the 10th International Conference on Tools and Algorithms for the Construction and Analysis of Software. Lecture Notes in Computer Science, vol. 2988, Springer-Verlag, Berlin, Germany, 467-481.
4. Alur, R., Kumar, V., Madhusudan, P., and Viswanathan, M. 2005b. Congruences for visibly pushdown languages. In Automata, Languages and Programming: Proceedings of the 32nd ICALP. Lecture Notes in Computer Science, vol. 3580, Springer-Verlag, Berlin, Germany, 1102-1114.
5. Alur, R., and Madhusudan, P. 2004. Visibly pushdown languages. In Proceedings of the 36th ACM Symposium on Theory of Computing. ACM, New York, 202-211.
6. Alur, R. and Madhusudan, P. 2006. Adding nesting structure to words. In Developments in Language Theory. Lecture Notes in Computer Science, vol. 4036, Springer-Verlag, Berlin, Germany, 1-13.
7. Autebert, J., Berstel, J., and Boasson, L. 1997. Context-free languages and pushdown automata. In Handbook of Formal Languages. Vol. 1. Springer, 111-174.
8. Ball, T., Majumdar, R., Millstein, T., and Rajamani, S. 2001. Automatic predicate abstraction of C programs. In Proceedings of the SIGPLAN Conference on Programming
9. Language Design and Implementation. ACM, New York, 203-213.
10. Ball, T., and Rajamani, S. 2000. Bebop: A symbolic model checker for boolean programs. In Proceedings of the SPIN 2000 Workshop on Model Checking of Software. Lecture Notes in Computer Science, vol. 1885, Springer-Verlag, Berlin, Germany, 113-130.
11. Berstel, J., and Boasson, L. 2002. Balanced grammars and their languages. In Formal and Natural Computing: Essays Dedicated to Grzegorz Rozenberg. Lecture Notes in Computer Science, vol. 2300, Springer-Verlag, Berlin, Germany, 3-25.
12. Bird, S., Chen, Y., Davidson, S., Lee, H., and Zheng, Y. 2006. Designing and evaluating an XPath dialect for linguistic queries. In Proceedings of the 22nd International Conference on Data Engineering. 52.
13. Boujjani, A., Esparza, J., and Maler, O. 1997. Reachability analysis of pushdown automata: Applications to model checking. In CONCUR'97: Proceedings of the 8th International Conference on Concurrency Theory. Lecture Notes in Computer Science, vol. 1243, Springer-Verlag, Berlin, Germany, 135-150.
14. Bouquet, A., Serre, O., and Walukiewicz, I. 2003. Pushdown games with unboundedness
15. and regular conditions. In FSTTCS 2003: Proceedings of the 23rd International Conference on Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science, vol. 2914, Springer-Verlag, Berlin, Germany, 88-99.
16. Bruggemann-Klein, A., Murata, M., and Wood, D. 2001. Regular tree and regular hedge languages over unranked alphabets: Version 1. Tech. Rep. HKUST-TCSC-2001-0, The Hongkong University of Science and Technology.
17. Bruggermann-Klein, A., and Wood, D. 2004. Balanced context-free grammars, hedge grammars and pushdown caterpillar automata. In Proceedings of the Extreme Markup Languages.
18. Burkart, O., and Steffen, B. 1992. Model checking for context-free processes. In CONCUR'92: Proceedings of the 3rd International Conference on Concurrency Theory. Lecture Notes in Computer Science, vol. 630, Springer-Verlag, Berlin, Germany, 123-137.
19. 3 winning condition. In Proceedings of the 11th Annual Conference of the European Association for Computer Science Logic, CSL 2002. Lecture Notes in Computer Science, vol. 2471, Springer-Verlag, Berlin, Germany, 322-336.
20. Chatterjee, K., Ma, D., Majumdar, R., Zhao, T., Henzinger, T., and Palsberg, J. 2004. Stack size analysis for interrupt driven programs. Inf. Computat. 194, 2, 144-174.
21. Chen, H. and Wagner, D. 2002. MOPS: An infrastructure for examining security properties of software. In Proceedings of ACM Conference on Computer and Communications Security. ACM, New York, 235-244.
22. Comon, H., Dauchet, M., Gilleron, R., Lugiez, D., Tison, S., and Tommasi, M. 2002. Tree automata techniques and applications. Draft, Available at http://www.grappa.univ-lille3.fr/tata/.
23. Dymond, P. 1988. Input-driven languages are in log n depth. Inf. Proc. Lett. 26, 5, 247-250.
24. Esparza, J., Kucera, A., and Schwoon, S. S. 2003. Model-checking LTL with regular valuations for pushdown systems. Inf. Computat. 186, 2, 355-376.
25. Ginsburg, S., and Harrison, M. 1967. Bracketed context-free languages. J. Comput. Syst. Sci. 1, 1-23.
26. Green, T., Miklau, G., Onizuka, M., and Suciu, D. 2003. Processing XML streams with deterministic automata. In ICDT '03: Proceedings of the 9th International Conference on Database Theory. Lecture Notes in Computer Science, vol. 2572, Springer-Verlag, Berlin, Germany, 173-189.
27. Gupta, A., and Suciu, D. 2003. Stream processing of XPath queries with predicates. In Proceedings of ACM SIGMOD Conference on Management of Data, ACM, New York, 419-430.
28. Harel, D., Kozen, D., and Tiuryn, J. 2000. Dynamic Logic. MIT Press, Cambridge, MA.
29. Henzinger, T., Jhala, R., Majumdar, R., Necula, G., Sutre, G., and Weimer, W. 2002. Temporal-safety proofs for systems code. In CAV 02: Proceedings of the 14th Annual Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol. 2404, Springer-Verlag, Berlin, Germany, 526-538.
30. Hoare, C. 1969. An axiomatic basis for computer programming. Commun. ACM 12, 10, 576-580.
31. Hopcroft, J., and Ullman, J. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA.
32. Jensen, T., Metayer, D. L., and Thorn, T. 1999. Verification of control flow based security properties. In Proceedings of the IEEE Symposium on Security and Privacy. IEEE Computer Society Press, Los Alamitos, CA, 89-103.
33. Knuth, D. 1967. A characterization of parenthesis languages. Inf. Cont. 11, 3, 269-289.
34. Lautemann, A., Schwentick, T., and Thorien, D. 1994. Logics for context-free languages. In Proceedings of the 8th International Workshop on Computer Science Logic (CSL 94). Lecture Notes in Computer Science, vol. 933, Springer-Verlag, New York, 205-216.
35. Libkin, L. 2005. Logics for unranked trees: An overview. In Proceedings of the 32nd International Colloquium in Automata, Languages and Programming. LNCS 3580, 35-50.
36. Loding, C., Madhusudan, P., and Serre, O. 2004. Visibly pushdown games.
37. In FSTTCS 2004: Proceedings of the 24th International Conference on Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science, vol. 3328, Springer-Verlag, Berlin, Germany, 408-420.
38. Martens, W., and Niehren, J. 2005. Minimizing tree automata for unranked trees. In Proceedings of the 10th International Symposium on Database Programming Languages. 233-247.
39. McNaughton, R. 1967. Parenthesis grammars. J. ACM 14, 3, 490-500.
40. Neven, F. 2002. Automata, logic, and XML. In Proceedings of the 11th Annual Conference of the European Association for Computer Science Logic CSL 2002. Lecture Notes in Computer Science, vol. 2471, Springer-Verlag, Berlin, Germany, 2-26.
41. Pnueli, A. 1977. The temporal logic of programs. In Proceedings of the 18th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 46-77.
42. Reps, T., Horwitz, S., and Sagiv, S. 1995. Precise interprocedural dataflow analysis via graph reachability. In Proceedings of the ACM Symposium on Principles of Programming Languages. ACM, New York, 49-61.
43. Schwentick, T. 2007. Automata for XML - A survey. J. Comput. Syst. Sci. 73, 3, 289-315.
44. Segoufin, L., and Vianu, V. 2002. Validating streaming XML documents. In Proceedings of the 21st ACM Symposium on Principles of Database Systems. ACM, New York, 53-64.
45. Sharir, M., and Pnueli, A. 1981. Two approaches to inter-procedural data-flow analysis. In Program flow analysis: Theory and applications. Prentice-Hall, Englewood Cliffs, NJ.
46. Thomas, W. 1990. Automata on infinite objects. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. Vol. B. Elsevier Science Publishers, Amsterdam, The Netherlands, 133-191.
47. Vardi, M., and Wolper, P. 1994. Reasoning about infinite computations. Inf. Computat. 115, 1, 1-37.
48. von Braunmuhl, B., and Verbeek, R. 1983. Input-driven languages are recognized in log n space. In Proceedings of the Symposium on Fundamentals of Computation Theory. Lecture Notes in Computer Science, vol. 158, Springer-Verlag, Berlin, Germany, 40-51.