On the reachability analysis of acyclic networks of pushdown systems

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

Volumn 5201 LNCS, Issue , 2008, Pages 356-371

  Atig, Mohamed Faouzi ^a   Bouajjani, Ahmed ^a   Touili, Tayssir ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; MESSAGE PASSING; NETWORK PROTOCOLS; SENSOR NETWORKS; TELECOMMUNICATION NETWORKS; THEOREM PROVING; TRANSLATION (LANGUAGES);

ACYCLIC NETWORKS; LOSSY CHANNELS; PUSHDOWN SYSTEMS; REACHABILITY ANALYSES; REACHABILITY PROBLEMS; REACHABILITY SETS; RECOGNIZABLE SETS; SHARED MEMORIES; STACK CONTENTS;

FINITE AUTOMATA;

EID: 54249120819     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85361-9_29     Document Type: Conference Paper

References (28)

1. Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: LICS 1996, pp. 313-321 (1996)
2. Abdulla, P.A., Collomb-Annichini, A., Bouajjani, A., Jonsson, B.: Using forward reachability analysis for verification of lossy channel systems. FMSD 25(1), 39-65 (2004)
3. Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. Inf. Comput. 127(2), 91-101 (1996)
4. Atig, M.F., Bouajjani, A., Touili, T.: On the reachability analysis of acyclic networks of pushdown systems. Research report, LIAFA lab (April 2008)
5. Berstel, J.: Transductions and context-free langages. TeubnerStudienbucher Informatik (1979)
6. Bouajjani, A., Esparza, J., Schwoon, S., Strejcek, J.: Reachability analysis of multithreaded software with asynchronous communication. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821. Springer, Heidelberg (2005)
7. Bouajjani, A., Esparza, J., Touili, T.: A generic approach to the static analysis of concurrent programs with procedures. Int. J. Found. Comput. Sci. 14(4), 551 (2003)
8. 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. Springer, Heidelberg (2005)
9. Bouajjani, A., Touili, T.: Reachability analysis of process rewrite systems. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol. 2914, pp. 74-87. Springer, Heidelberg (2003)
10. Bouajjani, A., Touili, T.: On computing reachability sets of process rewrite systems. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467. Springer, Heidelberg (2005)
11. Bouajjani, A., Esparza, J.: Rewriting models of boolean programs. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 136-150. Springer, Heidelberg (2006)
12. Chadha, R., Viswanathan, M.: Decidability results for well-structured transition systems with auxiliary storage. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 136-150. Springer, Heidelberg (2007)
13. Chaki, S., Clarke, E.M., Kidd, N., Reps, T.W., Touili, T.: Verifying concurrent messagepassing c programs with recursive calls. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 334-349. Springer, Heidelberg (2006)
14. Chambard, P., Schnoebelen, P.: Post embedding problem is not primitive recursive, with applications to channel systems. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol. 4855, pp. 265-276. Springer, Heidelberg (2007)
15. Esparza, J., Knoop, J.: An automata-theoretic approach to interprocedural dataflow analysis. In: Thomas, W. (ed.) FOSSACS 1999. LNCS, vol. 1578. Springer, Heidelberg (1999)
16. Esparza, J., Podelski, A.: Efficient algorithms for pre*and post*on interprocedural parallel flow graphs. In: POPL, pp. 1-11 (2000)
17. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! TCS 256(1-2), 63-92 (2001)
18. Jhala, R., Majumdar, R.: Interprocedural analysis of asynchronous programs. In: POPL. IEEE, Los Alamitos (2007)
19. Kahlon, V., Ivancic, F., Gupta, A.: Reasoning about threads communicating via locks. In: Etessami, K., Rajamani, S.K. (eds.)CAV2005. LNCS, vol. 3576. Springer, Heidelberg (2005)
20. 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. Springer, Heidelberg (2008)
21. Lammich, P., Müller-Olm, M.: Precise fixpoint-based analysis of programs with threadcreation and procedures. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703. Springer, Heidelberg (2007)
22. Lugiez, D., Schnoebelen, P.: The regular viewpoint on PA-processes. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 50-66. Springer, Heidelberg (1998)
23. Mayr, R.: Undecidable problems in unreliable computations. Theor. Comput. Sci. 1-3(297) (2003)
24. Qadeer, S., Rehof, J.: Context-bounded model checking of concurrent software. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440. Springer, Heidelberg (2005)
25. Schnoebelen, P.: Verifying lossy channel systems has nonprimitive recursive complexity. Inf. Process. Lett. 83(5) (2002)
26. Schwoon, S.: Model-Checking Pushdown Systems. PhD thesis, Technische Universität München (2002)
27. Sen, K., Viswanathan, M.: Model checking multithreaded programs with asynchronous atomic methods. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 300-314. Springer, Heidelberg (2006)
28. La Torre, S., Madhusudan, P., Parlato, G.: A robust class of context-sensitive languages. In: LICS, pp. 161-170. IEEE, Los Alamitos (2007)