On the Reachability Problem for Dynamic Networks of Concurrent Pushdown Systems

Authors:
Mohamed Faouzi Atig;Ahmed Bouajjani
Affiliations:
LIAFA, CNRS & Univ. Paris Diderot (Paris 7),;LIAFA, CNRS & Univ. Paris Diderot (Paris 7),
Venue:
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Year:
2009

Citing 1
Cited 2

Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads

TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,

Reasoning about threads with bounded lock chains

CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Reachability problem for weak multi-pushdown automata

CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

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).