Affiliation:
1. Stanford Univ., Stanford, CA
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.
Publisher
Association for Computing Machinery (ACM)
Reference16 articles.
1. Allen F.E. and Schwartz J.T. Determining the data relationships in a collection of procedures (unpublished detailed summary). Allen F.E. and Schwartz J.T. Determining the data relationships in a collection of procedures (unpublished detailed summary).
2. Ammann U. Compiler for PASCAL 6000--3.4. ETH Institut fiir Informatik Zurich Switzerland 1974. Ammann U. Compiler for PASCAL 6000--3.4. ETH Institut fiir Informatik Zurich Switzerland 1974.
3. An interprocedural data flow analysis algorithm
4. A Fast and Usually Linear Algorithm for Global Flow Analysis
Cited by
78 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献