A fast and usually linear algorithm for global flow analysis (abstract only)

Authors:
Susan L. Graham;Mark Wegman
Affiliations:
Univ. of California, Berkeley, Berkeley;Univ. of California, Berkeley, Berkeley
Venue:
Communications of the ACM
Year:
1975

Citing 0
Cited 1

ABCD: eliminating array bounds checks on demand

PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation

Quantified Score

Hi-index	48.22

Visualization

Abstract

ible graphs is presented. The algorithm is shown to treat a very general class of function spaces. For a graph of e edges, the algorithm has a worst case time bound of O(e log e) function operations. It is also shown that in programming terms, the number of operations is proportional to e plus the number of exits from program loops. Consequently a restriction to one-entry one-exit control structures guarantees linearity. The algorithm can be extended to yet larger classes of function spaces and graphs by relaxing the time bound. Examples are given of code improvement problems which can be solved using the algorithm.