Verifying parallel programs with dynamic communication structures

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

Volumn 5642 LNCS, Issue , 2009, Pages 145-154

  Atig, Mohamed Faouzi ^a   Touili, Tayssir ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION STRUCTURES; CONTROL STATE; DYNAMIC COMMUNICATION; DYNAMIC NETWORK; GENERAL MODEL; PARALLEL PROGRAM; PHASE GRAPHS; PROCEDURE CALL; PUSHDOWN SYSTEMS; REACHABILITY; REACHABILITY PROBLEM; SEMI-DECISION PROCEDURES; VERIFICATION PROBLEMS; WINDOWS NT;

CELLULAR TELEPHONE SYSTEMS; COMMUNICATION; PARALLEL ARCHITECTURES; SWITCHES; TRANSLATION (LANGUAGES);

BLUETOOTH;

EID: 70350380214     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02979-0_18     Document Type: Conference Paper

References (21)

1. 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)
2. 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)
3. 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)
4. Bouajjani, A., Esparza, J., Touili, T.: A generic approach to the static analysis of concurrent programs with procedures. In: POPL, pp. 62-73. ACM, New York (2003)
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. 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)
7. Bouajjani, A., Touili, T.: On computing reachability sets of process rewrite systems. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 484-499. Springer, Heidelberg (2005)
8. Chaki, S., Clarke, E.M., Kidd, N., Reps, T.W., Touili, T.: Verifying concurrent message-passing c programs with recursive calls. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 334-349. Springer, Heidelberg (2006)
9. Esparza, J., Knoop, J.: An automata-theoretic approach to interprocedural dataflow analysis. In: Thomas, W. (ed.) FOSSACS 1999. LNCS, vol. 1578, pp. 14-30. Springer, Heidelberg (1999)
10. * on interprocedural parallel flow graphs. In: POPL, pp. 1-11. ACM, New York (2000)
11. Esparza, J., Schwoon, S.: A bdd-based model checker for recursive programs. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 324-336. Springer, Heidelberg (2001)
12. Finkel, A., Willems, B., Wolper, P.: A direct symbolic approach to model checking pushdown systems. Electr. Notes Theor. Comput. Sci. 9 (1997)
13. Kahlon, V., Gupta, A.: On the analysis of interacting pushdown systems. In: POPL, pp. 303-314. ACM, New York (2007)
14. Kahlon, V., Ivancic, F., Gupta, A.: Reasoning about threads communicating via locks. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 505-518. Springer, Heidelberg (2005)
15. 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)
16. Müller-olm, M.: Variations on constants. Habilitation thesis, Dortmund University (2002)
17. 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)
18. Qadeer, S., Wu, D.: Kiss: keep it simple and sequential. In: PLDI, pp. 14-24. ACM, New York (2004)
19. Reps, T.W., Schwoon, S., Jha, S.: Weighted pushdown systems and their application to interprocedural dataflow analysis. In: Cousot, R. (ed.) SAS 2003. LNCS, vol. 2694, pp. 189-213. Springer, Heidelberg (2003)
20. Seidl, H., Steffen, B.: Constraint-based inter-procedural analysis of parallel programs. In: Smolka, G. (ed.) ESOP 2000. LNCS, vol. 1782, pp. 351-365. Springer, Heidelberg (2000)
21. La Torre, S., Madhusudan, P., Parlato, G.: A robust class of context-sensitive languages. In: LICS, pp. 161-170. IEEE Computer Society, Los Alamitos (2007)