From multi to single stack automata

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

Volumn 6269 LNCS, Issue , 2010, Pages 117-131

  Atig, Mohamed Faouzi ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT SWITCH; EMPTINESS PROBLEM; PUSH-DOWN AUTOMATA; PUSHDOWN SYSTEMS; REACHABILITY ANALYSIS; REACHABILITY PROBLEM; REGULAR LANGUAGES; SIMPLE ALGORITHM; STACK MACHINES; UPPER BOUND; VERIFICATION PROBLEMS;

DATA STRUCTURES; MODEL CHECKING;

AUTOMATA THEORY;

EID: 78249268238     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15375-4_9     Document Type: Conference Paper

References (18)

1. Atig, M.F., Bollig, B., Habermehl, P.: Emptiness of multi-pushdown automata is 2ETIME-complete. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol. 5257, pp. 121-133. Springer, Heidelberg (2008)
2. Atig, M.F., Bouajjani, A., Touili, T.: On the reachability analysis of acyclic networks of push-down systems. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 356-371. Springer, Heidelberg (2008)
3. Bouajjani, A., Esparza, J.: Rewriting models of boolean programs. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 136-150. Springer, Heidelberg (2006)
4. Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: Application to model-checking. In: Mazurkiewicz, A.,Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 135-150. Springer, Heidelberg (1997)
5. Bouajjani, A., Müller-Olm, M., Touili, T.: Regular symbolic analysis of dynamic networks of pushdown systems. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 473-487. Springer, Heidelberg (2005)
6. Breveglieri, L., Cherubini, A., Citrini, C., Crespi Reghizzi, S.: Multi-push-down languages and grammars. International Journal of Foundations of Computer Science 7(3), 253-292 (1996)
7. Caucal, D.: On infinite transition graphs having a decidable monadic theory. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 194-205. Springer, Heidelberg (1996)
8. Esparza, J., Knoop, J.: An automata-theoretic approach to interprocedural data-flow analysis. In: Thomas, W. (ed.) FOSSACS 1999. LNCS, vol. 1578, pp. 14-30. Springer, Heidelberg (1999)
9. Kahlon, V.: Boundedness vs. unboundedness of lock chains: Characterizing decidability of pairwise cfl-reachability for threads communicating via locks. In: LICS, pp. 27-36. IEEE Computer Society, Los Alamitos (2009)
10. Lal, A., Reps, T.W.: Reducing concurrent analysis under a context bound to sequential analysis. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 37-51. Springer, Heidelberg (2008)
11. Qadeer, S.: The case for context-bounded verification of concurrent programs. In: Havelund, K., Majumdar, R., Palsberg, J. (eds.) SPIN 2008. LNCS, vol. 5156, pp. 3-6. Springer, Heidelberg (2008)
12. Qadeer, S., Rehof, J.: Context-bounded model checking of concurrent software. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 93-107. Springer, Heidelberg (2005)
13. Ramalingam, G.: Context-sensitive synchronization-sensitive analysis is undecidable. ACM Trans. Program. Lang. Syst. 22(2), 416-430 (2000)
14. Reps, T.W., Schwoon, S., Jha, S.:Weighted pushdown systems and their application to inter-procedural dataflow analysis. In: Cousot, R. (ed.) SAS 2003. LNCS, vol. 2694, pp. 189-213. Springer, Heidelberg (2003)
15. Seth, A.: Global reachability in bounded phase multi-stack pushdown systems. In: CAV 2010. LNCS. Springer, Heidelberg (2010)
16. La Torre, S., Madhusudan, P., Parlato, G.: A robust class of context-sensitive languages. In: Proceedings of LICS, pp. 161-170. IEEE, Los Alamitos (2007)
17. La Torre, S., Madhusudan, P., Parlato, G.: An infinite automation characterization of double exponential time. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol. 5213, pp. 33-48. Springer, Heidelberg (2008)
18. La Torre, S., Madhusudan, P., Parlato, G.: Reducing context-bounded concurrent reachability to sequential reachability. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 477-492. Springer, Heidelberg (2009)