Reachability analysis of communicating pushdown systems

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

Volumn 6014 LNCS, Issue , 2010, Pages 267-281

  Heußner, Alexander ^a   Leroux, Jérôme ^a   Muscholl, Anca ^a   Sutre, Grégoire ^a  

^a UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK ARCHITECTURE; SEMANTICS;

COMPLEXITY BOUNDS; EXPONENTIAL TIME; EXPONENTIAL TIME ALGORITHM; FINITE STATE SYSTEMS; QUEUEING POLICIES; REACHABILITY ANALYSIS; RECURSIVE PROGRAMS; SIMPLER ALGORITHMS;

COMPUTABILITY AND DECIDABILITY;

EID: 77951462945     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-12032-9_19     Document Type: Conference Paper

References (20)

1. Atig, M.F., Bouajjani, A., 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 pushdown systems. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 356-371. Springer, Heidelberg (2008)
3. Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. Inf. Comput. 127(2), 91-101 (1996)
4. Bouajjani, A., Esparza, J., Schwoon, S., Strejcek, J.: Reachability analysis of multithreaded software with asynchronous communication. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 348-359. Springer, Heidelberg (2005)
5. Bouajjani, A., M̈uller-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. Brand, D., Zafiropulo, P.: On communicating finite-state machines. J. of the ACM 30(2), 323-342 (1983)
7. Cécé, G., Finkel, A.: Verification of programs with half-duplex communication. Inf. Comput. 202(2), 166-190 (2005)
8. Esparza, J., Kucera, A., Schwoon, S.: Model checking LTL with regular valuations for pushdown systems. Inf. Comput. 186(2), 355-376 (2003)
9. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theoretical Computer Science 256(1-2), 63-92 (2001)
10. Genest, B., Kuske, D., Muscholl, A.: A Kleene theorem and model checking algorithms for existentially bounded communicating automata. Inf. Comput. 204(6), 920-956 (2006)
11. Genest, B., Kuske, D., Muscholl, A.: On communicating automata with bounded channels. Fundamenta Informaticae 80, 147-167 (2007)
12. Jhala, R., Majumdar, R.: Interprocedural analysis of asynchronous programs. In: POPL 2007, pp. 339-350. ACM, New York (2007)
13. Rao Kosaraju, S.: Decidability of reachability in vector addition systems. In: STOC 1982, pp. 267-281. ACM, New York (1982)
14. Lohrey, M., Muscholl, A.: Bounded MSC communication. Inf. Comput. 189(2), 160-181 (2004)
15. La Torre, S., Madhusudan, P., Parlato, G.: A robust class of context-sensitive languages. In: LICS 2007, pp. 161-170. IEEE, Los Alamitos (2007)
16. La Torre, S., Madhusudan, P., Parlato, G.: Context-bounded analysis of concurrent queue systems. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 299-314. Springer, Heidelberg (2008)
17. Mayr, E.W.: An algorithm for the general Petri net reachability problem. SIAM J. Comput. 13(3), 441-460 (1984)
18. Papadimitriou, C.: Computational Complexity. Addison Wesley, Reading (1994)
19. 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)
20. Sen, K., Viswanathan, M.: Model checking multithreaded programs with synchronous atomic methods. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 300-314. Springer, Heidelberg (2006)