Join-lock-sensitive forward reachability analysis for concurrent programs with dynamic process creation

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

Volumn 6538 LNCS, Issue , 2011, Pages 199-213

  Gawlitza, Thomas Martin ^a   Lammich, Peter ^b   Müller Olm, Markus ^b   Seidl, Helmut ^c   Wenner, Alexander ^b  

^a VERIMAG   (France)

^b UNIVERSITY OF MÜNSTER   (Germany)

^c TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BASIC MODELS; BASIC RESULTS; CONCURRENT PROGRAM; DYNAMIC PROCESS; PARALLEL PROGRAM; REACHABILITY; REACHABILITY ANALYSIS; STABLE CONSTRAINTS; TREE TRANSDUCERS;

ABSTRACTING; PARALLEL ARCHITECTURES;

MODEL CHECKING;

EID: 79251538064     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-18275-4_15     Document Type: Conference Paper

References (11)

1. 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) (Pubitemid 127089315)
2. Bouajjani, A., Müller-Olm, M., Touili, T.: Regular symbolic analysis of dynamic networks of pushdown systems. In: Jayaraman, K., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 473-487. Springer, Heidelberg (2005) (Pubitemid 41520760)
3. Engelfriet, J.,Vogler, H.: Macro tree transducers. J. Comput. Syst. Sci. 31(1), 71-146 (1985)
4. Esparza, J., Podelski, A.: Efficient algorithms for pre* and post* on interprocedural parallel flow graphs. In: POPL, pp. 1-11 (2000)
5. Gawlitza, T.M., Lammich, P., Müller-Olm, M., Seidl, H., Wenner, A.: Join-locksensitive forward reachability analysis for concurrent programs with dynamic process creation, http://cs.uni-muenster.de/sev/publications/ (extended version)
6. Kahlon, V., Gupta, A.: An automata-theoretic approach for model checking threads for LTL properties. In: Proc. of LICS 2006, pp. 101-110. IEEE Computer Society, Los Alamitos (2006)
7. Kahlon, V., Ivančić, 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) (Pubitemid 41431760)
8. Kidd, N., Lal, A., Reps, T.W.: Language strength reduction. In: Alpuente, M., Vidal, G. (eds.) SAS 2008. LNCS, vol. 5079, pp. 283-298. Springer, Heidelberg (2008)
9. Lammich, P., Müller-Olm, M., Wenner, A.: Predecessor sets of dynamic pushdown networks with tree-regular constraints. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 525-539. Springer, Heidelberg (2009)
10. Müller-Olm, M., Seidl, H.: On optimal slicing of parallel programs. In: STOC, pp. 647-656 (2001)
11. Seidl, H., Steffen, B.: Constraint-based inter-procedural analysis of parallel programs. Nord. J. Comput. 7(4), 375 (2000)