A practical interprocedural data flow analysis algorithm
Jeffrey M. Barth · Communications of the ACM · 1978
A new interprocedural data flow analysis algorithm is presented and analyzed. The algorithm associates with each procedure in a program information about which variables may be modified, which may be used, and which are possibly preserved by a call on the procedure, and all of its subcalls. The algorithm is sufficiently powerful to be used on recursive programs and to deal with the sharing of variables which arises through reference parameters. The algorithm is unique in that it can compute all of this information in a single pass, not requiring a prepass to compute calling relationships or sharing patterns. The algorithm is asymptotically optimal in time complexity. It has been implemented and is practical even on programs which are quite large.
Cited by 154 works. doi:10.1145/359588.359596 Open-access PDF
Authors
References
- Revised report on the algorithmic language ALGOL 60
- A Fast and Usually Linear Algorithm for Global Flow Analysis
- Interprocedural Data Flow Analysis.
- A Simple Algorithm for Global Data Flow Analysis Problems
- Solving path problems on directed graphs.
- Data Flow Analysis for Procedural Languages
- Analysis of a simple algorithm global data flow problems
- Exposing Side-Effects in a PL/I Optimizing Compiler.
- Data Flow Analysis in the Presence of Procedure Calls
- An interprocedural data flow analysis algorithm