Title :
Data dependency graphs for Ada programs
Author :
Moser, Louise E.
Author_Institution :
Dept. of Electr. & Comput. Eng., California Univ., Santa Barbara, CA, USA
fDate :
5/1/1990 12:00:00 AM
Abstract :
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
Keywords :
Ada; data structures; programming; Ada programs; composition rules; correctness; data dependency graphs; exception handling; information flow; iteration; primitive program statements; program development environment; recursion; tasking; tracking; Computer languages; Data analysis; Data security; Data structures; Information analysis; Information security; Modems; National security; Performance analysis; Software reliability;
Journal_Title :
Software Engineering, IEEE Transactions on
