A program data flow analysis procedure
Communications of the ACM
A unified approach to global program optimization
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Analysis of a simple algorithm for global data flow problems
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Node listings applied to data flow analysis
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Node listings for reducible flow graphs
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Three simple node list algorithms
Computer Languages
Hi-index | 0.00 |
This paper presents two straightforward algorithms for generating node lists for reducible graphs. The algorithms are much simpler than those of Aho and Ullman [1]. The length of the node list produced by the algorithms given here is bounded above by (d + 1)n, where n is the number of nodes in the graph and d is the number of nodes that are tails of back edges. For realistic programs, however, the algorithms given here produce much shorter node lists, generally of length less than 3n. This paper emphasizes simplicity of the algorithms.