A model of Ada programs for static deadlock detection in polynomial times
Stephen P. Masticola, Barbara G. Ryder · 1991
We have designed a safe, polynomial time approximation algorithm for static deadlock detection in a subset of the Ada language [MR90b].We extend the program representation to include nearly all of the Ada rendezvous primitives, and present preliminary experimental results for an implementation of our algorithm.Our goal is to develop an automatic facility to accurately certify deadlock freedom for a large class of Ada programs.