Affiliation:
1. LIAFA, Université Paris Diderot
Abstract
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 multithreaded programs.
Funder
Fondation Sciences Mathématiques de Paris
Agence Nationale de la Recherche
Publisher
Association for Computing Machinery (ACM)
Reference79 articles.
1. May-happen-in-parallel analysis of X10 programs
2. Allen E. Chase D. Luchangco V. Maessen J.-W. Ryu S. Steele Jr. G. L. and Tobin-Hochstadt S. 2006. The fortress language specification. Tech. rep. Sun Microsystems Inc. Allen E. Chase D. Luchangco V. Maessen J.-W. Ryu S. Steele Jr. G. L. and Tobin-Hochstadt S. 2006. The fortress language specification. Tech. rep. Sun Microsystems Inc.
3. Limits for automatic verification of finite-state concurrent systems
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Reachability Problem for Petri Nets Is Not Elementary;Journal of the ACM;2021-02
2. The ABCs of petri net reachability relaxations;ACM SIGLOG News;2020-11-16
3. Formalizing and Checking Multilevel Consistency;Lecture Notes in Computer Science;2020
4. KReach: A Tool for Reachability in Petri Nets;Tools and Algorithms for the Construction and Analysis of Systems;2020
5. The reachability problem for Petri nets is not elementary;Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing;2019-06-23