A practical interprocedural data flow analysis algorithm
- 1 September 1978
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 21 (9) , 724-736
- https://doi.org/10.1145/359588.359596
Abstract
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.Keywords
This publication has 4 references indexed in Scilit:
- An interprocedural data flow analysis algorithmPublished by Association for Computing Machinery (ACM) ,1977
- A Fast and Usually Linear Algorithm for Global Flow AnalysisJournal of the ACM, 1976
- A Simple Algorithm for Global Data Flow Analysis ProblemsSIAM Journal on Computing, 1975
- Revised report on the algorithmic language ALGOL 60Communications of the ACM, 1963