Data dependency graphs for Ada programs
- 1 May 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 16 (5) , 498-509
- https://doi.org/10.1109/32.52773
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
This publication has 16 references indexed in Scilit:
- Incremental data-flow analysis algorithmsACM Transactions on Programming Languages and Systems, 1988
- Advanced compiler optimizations for supercomputersCommunications of the ACM, 1986
- The program dependence graph in a software development environmentACM SIGPLAN Notices, 1984
- Dependence graphs and compiler optimizationsPublished by Association for Computing Machinery (ACM) ,1981
- A precise inter-procedural data flow algorithmPublished by Association for Computing Machinery (ACM) ,1981
- High-level data flow analysisCommunications of the ACM, 1977
- Certification of programs for secure information flowCommunications of the ACM, 1977
- Symbolic evaluation and the global value graphPublished by Association for Computing Machinery (ACM) ,1977
- Graph grammars and global program data flow analysisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1976
- A unified approach to global program optimizationPublished by Association for Computing Machinery (ACM) ,1973