Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation-Reference-Cited by-同舟云学术

Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation

Published:2011 Issue: Volume: Page:199-213
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Gawlitza Thomas Martin,Lammich Peter,Müller-Olm Markus,Seidl Helmut,Wenner Alexander

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-18275-4_15

Reference11 articles.

1. Lecture Notes in Computer Science;A. Bouajjani,1997

2. Lecture Notes in Computer Science;A. Bouajjani,2005

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)

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Navigation Logic for Recursive Programs with Dynamic Thread Creation;Lecture Notes in Computer Science;2023-12-30

2. Model Checking Dynamic Pushdown Networks with Locks and Priorities;Networked Systems;2019

3. CARET Analysis of Multithreaded Programs;Logic-Based Program Synthesis and Transformation;2018

4. Constrained Dynamic Tree Networks;Lecture Notes in Computer Science;2018

5. Reachability for Dynamic Parametric Processes;Lecture Notes in Computer Science;2017