Journal Article10.1080/00207167508803104
An algorithm for tracing live variables based on a straightened program graph
3
TL;DR: An algorithm is given for finding where the variables of a program are active or live, based on the flow graph straightening procedure of Earnest, Balke, and Anderson, rather than on Cocke-Allen intervals, which can be applied to any program, without appeal to any additional mechanism such as node splitting.
read more
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Graph grammars and global program data flow analysis
R. Farrow,Ken Kennedy,L. Zucconi +2 more
- 25 Oct 1976
TL;DR: If a given graph is generated by the grammar, repeated application of the reductions will result in a single node regardless of the order in which they are applied, which gives rise to an algorithm that parses a given program flow graph in time linear in the size of the graph.
62
Applications of a graph grammar for program control flow analysis
Ken Kennedy,Linda Zucconi +1 more
- 01 Jan 1977
TL;DR: This paper studies the applicability of a grammatical approach to describing the set of control flow graphs which arise from "good" programs in the sense proposed by many programming practitioners and addresses several new questions.
30
Profitability computations on program flow graphs
John Cocke,Ken Kennedy +1 more
TL;DR: A solution method which uses “Cocke-Allen interval” analysis is presented and extensions of this method to other global flow analysis problems are described.
15
References
Analysis of a simple algorithm for global data flow problems
Matthew S. Hecht,Jeffrey D. Ullman +1 more
- 01 Oct 1973
TL;DR: There is an ordering of the nodes of a flow graph G which topologically sorts the dominance relation and can be found in 0(edges) bit vector steps and it follows that there is a very simple bit propagation algorithm which also uses the above ordering, and is at least as good as the interval algorithm for solving all known global data flow problems.
72
A global flow analysis algorithm
TL;DR: A global algorithm which uses interval analysis techniques to recognize live variables is presented and it is shown that this algorithm can be used to solve the challenge of recognizing live variables in discrete time.
65
Analysis of Graphs by Ordering of Nodes
TL;DR: A method of analyzing directed graphs by establishing a particular ordering for the nodes is presented, and properties of the ordered graph are derived.
28
A Comparison of Two Algorithms for Global Data Flow Analysis
TL;DR: The problem of determining the points in a program at which variables are “live” (will be used again) is introduced and discussed and two solutions, one which uses a simple iterative algorithm and an algorithm based on “Cocke–Allen interval” analysis are presented and analyzed.
21
Some Topics in Code Optimization
TL;DR: The methods here applied to collecting information for use in code optimization include general algorithms for solving a set of linear equations in Boolean algebra, which are most useful when the coefficient matrix is sparse.
14
Related Papers (5)
R. Farrow,Ken Kennedy,L. Zucconi +2 more
- 25 Oct 1976
Akira Koseki,Hideaki Komatsu,Toshio Nakatani +2 more
- 17 May 2002