A model of Ada programs for static deadlock detection in polynomial times
- 1 December 1991
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 26 (12) , 97-107
- https://doi.org/10.1145/127695.122768
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Analysis of event synchronization in a parallel programming toolPublished by Association for Computing Machinery (ACM) ,1990
- Properties of data flow frameworksActa Informatica, 1990
- Verifying general safety properties of Ada tasking programsIEEE Transactions on Software Engineering, 1990
- A practical algorithm for static analysis of parallel programsJournal of Parallel and Distributed Computing, 1989
- Detection of Ada static deadlocks using Petri net invariantsIEEE Transactions on Software Engineering, 1989
- Task interaction graphs for concurrency analysisPublished by Association for Computing Machinery (ACM) ,1989
- Static analysis of low-level synchronizationPublished by Association for Computing Machinery (ACM) ,1988
- Combining static concurrency analysis with symbolic executionIEEE Transactions on Software Engineering, 1988
- A general-purpose algorithm for analyzing concurrent programsCommunications of the ACM, 1983
- Complexity of analyzing the synchronization structure of concurrent programsActa Informatica, 1983