Node listings applied to data flow analysis
KW Kennedy - Proceedings of the 2nd ACM SIGACT-SIGPLAN …, 1975 - dl.acm.org
KW Kennedy
Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of …, 1975•dl.acm.orgA new approach to global program data flow analysis which constructs a" node listing" for
the control flow graph is discussed and a simple algorithm which uses a node listing to
determine the live variables in a program is presented. This algorithm combined with a fast
node listing constructor due to Aho and Ullman has produced an 0 (n log n) algorithm for live
analysis. The utility of the node-listing method is demonstrated by an examination of the
class of graphs for which" short" listings exist. This class is quite similar to the class of graphs …
the control flow graph is discussed and a simple algorithm which uses a node listing to
determine the live variables in a program is presented. This algorithm combined with a fast
node listing constructor due to Aho and Ullman has produced an 0 (n log n) algorithm for live
analysis. The utility of the node-listing method is demonstrated by an examination of the
class of graphs for which" short" listings exist. This class is quite similar to the class of graphs …
A new approach to global program data flow analysis which constructs a "node listing" for the control flow graph is discussed and a simple algorithm which uses a node listing to determine the live variables in a program is presented. This algorithm combined with a fast node listing constructor due to Aho and Ullman has produced an 0(n log n) algorithm for live analysis. The utility of the node-listing method is demonstrated by an examination of the class of graphs for which "short" listings exist. This class is quite similar to the class of graphs for "understandable" programs.