This paper illustrates the use of loop nesting forests in two applications. The first is a new algorithm for computing the iterated dominance frontier of a set of vertices in a graph, which can be used to construct representations such as the SSA form [7] and Sparse Evaluation Graphs [5]. The second is a new algorithm for constructing the dominator
|
5943
|
Introduction to Algorithms
– Cormen, Leiserson, et al.
- 1990
|
|
648
|
Efficiently computing static single assignment form and the control dependence graph
– Cytron, Ferrante, et al.
- 1991
|
|
508
|
Data Structures and Network Algorithms
– Tarjan
- 1983
|
|
109
|
Automatic Construction of Sparse Data Flow Evaluation Graphs
– Choi, Cytron, et al.
- 1991
|
|
106
|
A fast algorithm for finding dominators in a flow graph
– Lengauer, Tarjan
- 1979
|
|
96
|
Data structures for weighted matching and nearest common ancestors with linking
– Gabow
- 1990
|
|
76
|
Testing flow graph reducibility
– Tarjan
- 1974
|
|
72
|
Applications of path compression on balanced trees
– Tarjan
- 1979
|
|
52
|
Building an Optimizing Compiler
– Morgan
- 1998
|
|
44
|
A linear time algorithm for finding dominators in flow graphs and related problems
– Harel
- 1985
|
|
42
|
Code motion of control structures in high-level languages
– CYTRON, LOWRY, et al.
|
|
34
|
Symbolic Evaluation and the Global Value Graph
– Reif, Lewis
- 1977
|
|
33
|
Eciently computing static single assignment form and the control dependence graph
– Cytron, Ferrante, et al.
- 1991
|
|
23
|
A linear time algorithm for placing OE-nodes
– Sreedhar, Gao
- 1995
|
|
21
|
Identifying loops using DJ graphs
– Sreedhar, Gao, et al.
- 1996
|
|
18
|
Nesting of reducible and irreducible loops
– Havlak
- 1997
|
|
18
|
Optimal Control Dependence Computation and the Roman Chariots Problem
– Pingali, Bilardi
- 1997
|
|
17
|
Dominators in linear time
– Alstrup, Harel, et al.
- 1999
|
|
13
|
An Incremental Algorithm for Maintaining the Dominator Tree of a Reducible Flowgraph
– Ramalingam, Reps
- 1994
|
|
12
|
Sequentializing program dependence graphs for irreducible programs
– Steensgaard
- 1993
|
|
11
|
A new, simpler linear-time dominators algorithm
– Buchsbaum, Kaplan, et al.
- 1998
|
|
10
|
A linear time algorithm for placing -nodes
– Sreedhar, Gao
- 1995
|
|
9
|
The transitive closure of control dependence: the iterated join
– Weiss
- 1992
|
|
8
|
Efficient symbolic analysis of programs
– Reif, Lewis
- 1986
|
|
7
|
Identifying loops in almost linear time
– Ramalingam
- 1999
|
|
7
|
Efficient Program Analysis Using DJ Graphs
– Sreedhar
- 1995
|
|
6
|
On sparse evaluation representations
– Ramalingam
- 1997
|
|
2
|
A simple and optimal algorithm for finding immediate dominators in reducible graphs
– Alstrup, Lauridsen
- 1996
|
|
1
|
Identifyingloops using DJ graphs
– Sreedhar, Gao, et al.
- 1996
|
|
