Home → Magazine Archive → May 1983 (Vol. 26, No. 5) → A general-purpose algorithm for analyzing concurrent... → Abstract

A general-purpose algorithm for analyzing concurrent programs

By Richard N. Taylor

Communications of the ACM, Vol. 26 No. 5, Pages 361-376

Save PDF
Developing and verifying concurrent programs presents several problems. A static analysis algorithm is presented here that addresses the following problems: how processes are synchronized, what determines when programs are run in parallel, and how errors are detected in the synchronization structure. Though the research focuses on Ada, the results can be applied to other concurrent programming languages such as CSP.

The full text of this article is premium content


No entries found