An algorithm for tracing live variables based on a straightened program graph
- 1 January 1975
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 5 (1) , 97-108
- https://doi.org/10.1080/00207167508803104
Abstract
An algorithm is given for finding where the variables of a program are active or live. While the algorithm is modeled after that of Kennedy, it is based on the flow graph straightening procedure of Earnest, Balke, and Anderson, rather than on Cocke-Allen intervals. Thus it can be applied to any program, without appeal to any additional mechanism such as node splitting.Keywords
This publication has 4 references indexed in Scilit:
- A Comparison of Two Algorithms for Global Data Flow AnalysisSIAM Journal on Computing, 1976
- Some Topics in Code OptimizationJournal of the ACM, 1974
- A global flow analysis algorithmInternational Journal of Computer Mathematics, 1972
- Analysis of Graphs by Ordering of NodesJournal of the ACM, 1972