A general-purpose algorithm for analyzing concurrent programs
Richard N. Taylor · Communications of the ACM · 1983
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.
Cited by 308 works. doi:10.1145/69586.69587
Authors
References
- The Art of Computer Programming
- The Design and Analysis of Computer Algorithms
- The Art of Computer Programming: Volume 3: Sorting and Searching
- Communicating sequential processes
- The Art of Computer Programming. Volume 1: Fundamental Algorithms.
- Communicating sequential processes
- Flow Analysis of Computer Programs
- Distributed processes
- Symbolic Testing and the DISSECT Symbolic Evaluation System
- Dave—a validation error detection and documentation system for fortran programs