An Ada deadlock testing algorithm based on control and communication flow graphs
A. von Mayrhauser, Shao-Ming Simon Hsueh · 1992
This paper presents a static analysis method for examining and removing communication deadlock that is less expensive in time and space than Static Concurrency Analysis, Task Interaction Graph Analysis and Ada Petri Net Analysis.Our algorithm also is more powerful.Furthermore its information is easily available as part of the parsing commonly done for software tools based on static code analysis.Thus it fits well into planned or existing tool chests.