Analysis of Recursively Parallel Programs

作者：Bouajjani Ahmed^*; Emmi Michael

来源：ACM Sigplan Notices, 2012, 47(1): 203-214.

DOI：10.1145/2103621.2103681

• Algorithms
• Reliability
• Verification
• Concurrency
• Parallelism
• Verification

We propose a general formal model of isolated hierarchical parallel computations, and identify several fragments to match the concurrency constructs present in real-world programming languages such as Cilk and X10. By associating fundamental formal models (vector addition systems with recursive transitions) to each fragment, we provide a common platform for exposing the relative difficulties of algorithmic reasoning. For each case we measure the complexity of deciding state-reachability for finite-data recursive programs, and propose algorithms for the decidable cases. The complexities which include PTIME, NP, EXPSPACE, and 2EXPTIME contrast with undecidable state-reachability for recursive multi-threaded programs.

• 出版日期2012-1