Visibly pushdown languages

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 202-211

  Alur, Rajeev ^a   Madhusudan, P ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Context free languages; Logic; Pushdown automata; Regular tree languages; Verification; languages

Indexed keywords

ALGORITHMS; DECISION THEORY; FORMAL LOGIC; OPTIMIZATION; ROBUSTNESS (CONTROL SYSTEMS); THEOREM PROVING; TREES (MATHEMATICS);

CONTEXT-FREE LANGUAGES; PUSHDOWN AUTOMATA; REGULAR TREE LANGUAGES; VERIFICATION;

COMPUTER PROGRAMMING LANGUAGES;

EID: 4544311800     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007390     Document Type: Conference Paper

References (24)

1. J. Autebert, J. Berstel, L. Boasson. Context-free languages and pushdown automata. In Handbook of Formal Languages, Vol. 1, pages 111-174, Springer, 1997.
2. R. Alur, K. Etessami, and P. Madhusudan. A temporal logic of nested calls and returns. To appear in Proc. of Tools and Algorithms for the Construction and Analysis of Systems, 10th International Conference, TACAS'04, Spain, LNCS 2988. Springer, 2004.
3. R. Alur, K. Etessami, and M. Yannakakis. Analysis of recursive state machines. In Proc. of the 13th International Conference on Computer Aided Verification, LNCS 2102, pages 207-220. Springer, 2001.
4. J. Berstel and L. Boasson. Balanced grammars and their languages. In Formal and Natural Computing: Essays Dedicated to Grzegorz Rozenberg, LNCS 2300, pages 3-25. Springer, 2002.
5. A. Boujjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Applications to model checking. In CONCUR'97: Concurrency Theory, Eighth International Conference, LNCS 1243, pages 135-150. Springer, 1997.
6. T. Ball and S. Rajamani. Bebop: A symbolic model checker for boolean programs. In SPIN 2000 Workshop on Model Checking of Software, LNCS 1885, pages 113-130. Springer, 2000.
7. O. Burkart and B. Steffen. Model checking for context-free processes. In CONCUR'92: Concurrency Theory, Third International Conference, LNCS 630, pages 123-137. Springer. 1992.
8. A. Bouquet, O. Serre and I. Walukiewicz. Pushdown games with unboundedness and regular conditions. To appear in Foundations of Software Technology and Theoretical Computer Science (FSTTCS), December 2003.
9. H. Comon, M. Dauchet, R. Gilleron, D. Lugiez, S. Tison and M. Tommasi. Tree automata techniques and applications. Draft, Available at http://www.grappa.univ-lille3.fr/tata/, 2002.
10. 3 winning condition. In Proceedings of the 11th Annual Conference of the European Association for Computer Science Logic, CSL 2002, volume 2471 of Lecture Notes in Computer Science, pages 322-336. Springer, 2002.
11. R.S. Cohen and A.Y. Gold. Theory of omega-Languages. I. Characterizations of omega-Context-Free Languages. JCSS 15(2): 169-184, 1977.
12. K. Chatterjee, D. Ma, R. Majumdar, T. Zhao, T.A. Henzinger, and J. Palsberg. Stack size analysis for interrupt driven programs. In Proceedings of the 10th International Symposium on Static Analysis, volume LNCS 2694, pages 109-126, 2003.
13. H. Chen and D. Wagner. Mops: an infrastructure for examining security properties of software. In Proceedings of ACM Conference on Computer and Communications Security, pages 235-244, 2002.
14. J. Esparza, A. Kucera, and S. S. Schwoon. Model-checking LTL with regular valuations for pushdown systems. Information and Computation, 186(2):355-376, 2003.
15. T.A. Henzinger, R. Jhala, R. Majumdar, G.G. Necula, G. Sutre, and W. Weimer. Temporal-safety proofs for systems code. In CA V 02: Proc. of 14th Conf. on Computer Aided Verification, LNCS 2404, pages 526-538. Springer, 2002.
16. D. Harel, D. Kozen and J. Tiuryn. Dynamic Logic. MIT Press, 2000.
17. T. Jensen, D. Le Metayer, and T. Thorn. Verification of control flow based security properties. In Proceedings of the IEEE Symposium on Security and Privacy, pages 89-103, 1999.
18. D.E. Knuth. A characterization of parenthesis languages. Information and Control, 11(3):269-289, 1967.
19. G. Lautemann, T. Schwentick and D. Thérien. Logics For context-free languages. In Proceedings of Computer Science Logic, 8th International Workshop, CSL '94, Poland, LNCS 933, pages 205-216. Springer, 1994.
20. R. McNaughton. Parenthesis grammars. Journal of the ACM, 14(3):490-500, 1967.
21. T. Reps, S. Horwitz, and S. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In Proceedings of the ACM Symposium on Principles of Programming Languages, pages 49-61, 1995.
22. S. Safra. On the complexity of ω-automata. In Proceedings of the 29th IEEE Symposium on Foundations of Computer Science, pages 319-327, 1988.
23. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 133-191. Elsevier Science Publishers, 1990.
24. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proceedings of the First IEEE Symposium on Logic in Computer Science, pages 332-344, 1986.