Automated partial communication deadlock analysis after changes to Ada code

When writing concurrent Ada programs, deadlock is always a possibility. Existing algorithms to analyze for deadlock are either very limited or relatively expensive. While the best are still quite feasible for inclusion in an Ada developer´s toolbox, costs start becoming high when changes to code force repeated full re-analysis. This paper uses control-and-communication flow analysis as a basis to derive an efficient algorithm for automated partial re-analysis of Ada programs with respect to communication deadlock. Re-analysis needs are determined based on types of code changes. The paper also presents an analytic evaluation of the efficiency of the re-analysis technique