Issue No.05 - May (1990 vol.16)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.52773
<p>A compositional method of constructing data dependency graphs for Ada programs is presented. These graphs are useful in a program development environment for analyzing data dependencies and tracking information flow within a program. Graphs for primitive program statements are combined together to form graphs for larger program units. Composition rules are described for iteration, recursion, exception handling, and tasking, as well as for simpler Ada constructs. The correctness of the construction and the practicality of the technique are discussed.</p>
composition rules; Ada programs; data dependency graphs; program development environment; tracking; information flow; primitive program statements; iteration; recursion; exception handling; tasking; correctness; Ada; data structures; programming.
L.E. Moser, "Data Dependency Graphs for Ada Programs", IEEE Transactions on Software Engineering, vol.16, no. 5, pp. 498-509, May 1990, doi:10.1109/32.52773