A robust class of context-sensitive languages

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2007, Pages 161-170

  La Torre, Salvatore ^a   Madhusudan, P ^b   Parlato, Gennaro ^a,b  

^a UNIVERSITY OF SALERNO   (Italy)

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

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN OPERATIONS; CLOSURE UNDER BOOLEAN OPERATIONS; MONADIC SECOND-ORDER LOGIC; MULTITHREADED; PUSH-DOWN AUTOMATA; RECURSIVE PROGRAMS; SEARCH SPACES; VISIBLY PUSHDOWN LANGUAGES;

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; COMPUTER SCIENCE; CONTEXT FREE LANGUAGES;

CONTEXT SENSITIVE LANGUAGES;

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

References (22)

1. R. Alur and P. Madhusudan. Visibly pushdown languages. In STOC, pages 202-211, 2004.
2. R. Alur and P. Madhusudan. Adding nesting structure to words. In DLT, LNCS 4036, pages 1-13, 2006. (Pubitemid 44089604)
3. A. Bouajjani, J. Esparza, S. Schwoon, and J. Strejcek. Reachability analysis of multithreaded software with asynchronous communication. In FSTTCS, LNCS 3821, pages 348-359, 2005. (Pubitemid 43846917)
4. A. Bouajjani, M. Müller-Olm, and T. Touili. Regular symbolic analysis of dynamic networks of pushdown systems. In CONCUR, LNCS 3653, pages 473-487, 2005. (Pubitemid 41520760)
5. S. Chaki, E. M. Clarke, N. Kidd, T. W. Reps, and T. Touili. Verifying concurrent message-passing C programs with recursive calls. In TACAS, LNCS 3920, pages 334-349, 2006. (Pubitemid 44019380)
6. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications, 1997.
7. J. Doner. Tree acceptors and some of their applications. J. Comput. Syst. Sci., 4(5):406-451, 1970.
8. E. A. Emerson. Temporal and modal logic. In [21], pages 995-1072.
9. S. Ginsburg, S. A. Greibach, and M. A. Harrison. One-way stack automata. J. ACM, 14(2):389-418, 1967.
10. D. Harel and D. Raz. Deciding properties of nonregular programs. SIAM J. Comput., 22(4):857-874, 1993. (Pubitemid 23677150)
11. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
12. V. Kahlon, F. Ivancic, and A. Gupta. Reasoning about threads communicating via locks. In CAV, LNCS 3576, pages 505-518, 2005. (Pubitemid 41431760)
13. T. Knapik, D. Niwinski, and P. Urzyczyn. Higher-order pushdown trees are easy. In FoSSaCS, LNCS 2303, pages 205-222, 2002.
14. C. Löding and O. Serre. Propositional dynamic logic with recursive programs. In FoSSaCS, LNCS 3921, pages 292-306, 2006. (Pubitemid 44019347)
15. R. Parikh. On context-free languages. J. ACM, 13(4):570-581, 1966.
16. S. Qadeer and J. Rehof. Context-bounded model checking of concurrent software. In TACAS, LNCS 3440, pages 93-107, 2005. (Pubitemid 41273736)
17. S. Qadeer and D. Wu. Kiss: keep it simple and sequential. In PLDI, pages 14-24. ACM, 2004.
18. J. W. Thatcher and J. B. Wright. Generalized finite automata theory with an application to a decision problem of second-order logic. Math. Sys. Theory, 2(1):57-81, 1968.
19. W. Thomas. Automata on infinite objects. In [21], pages 133-192.
20. W. Thomas. Languages, automata, and logic. In Handbook of Formal Languages, Volume 3, pages 389-455. SpringerVerlag New York, Inc., New York, NY, USA, 1997.
21. J. van Leeuwen, editor. Handbook of Theoretical Computer Science, Volume B. Elsevier and MIT Press, 1990.
22. M. Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. J. Comput. Syst. Sci., 32(2):183-221, 1986. (Pubitemid 16586688)