Abstract
We consider the problem of checking safety properties for concurrent programs. We assume that programs may have (potentially recursive) procedure calls as well as (unbounded) dynamic creation of parallel threads. Each procedure can have a finite number of local variables, and there is a finite number of global variables that can be accessed by all parallel threads. We assume that these variables range over a finite data domain (e.g., booleans).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Atig, M.F., Bouajjani, A., Qadeer, S.: Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads. In: 15th Intern. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2009). LNCS, vol. 5505, pp. 107–123. Springer, Heidelberg (2009)
Atig, M.F., Bouajjani, A., Touili, T.: Analyzing Asynchronous Programs with Preemption. In: IARCS Ann. Intern. Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2008), Leibniz Intern. Proc. in Informatics, vol. 2. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Atig, M.F., Bouajjani, A. (2009). On the Reachability Problem for Dynamic Networks of Concurrent Pushdown Systems. In: Bournez, O., Potapov, I. (eds) Reachability Problems. RP 2009. Lecture Notes in Computer Science, vol 5797. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04420-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-04420-5_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04419-9
Online ISBN: 978-3-642-04420-5
eBook Packages: Computer ScienceComputer Science (R0)