y Intel Corp.
|
284
|
Constant propagation with conditional branches
– Wegman, Zadeck
- 1991
|
|
266
|
Flow Analysis of Computer Programs
– Hecht
- 1977
|
|
187
|
Detecting equality of variables in programs
– Alpern, Wegman, et al.
- 1988
|
|
156
|
Global value numbers and redundant computations
– Rosen, Wegman, et al.
- 1988
|
|
108
|
Automatic construction of sparse data flow evaluation graphs
– Choi, Cytron, et al.
- 1991
|
|
105
|
A fast algorithm for finding dominators in a flowgraph
– Lengauer, Tarjan
- 1979
|
|
75
|
Testing flow graph reducibility
– Tarjan
- 1974
|
|
74
|
Fast Algorithms for Solving Path Problems
– Tarjan
- 1981
|
|
72
|
An interval-based approach to exhaustive and incremental interprocedural data-flow analysis
– Burke
- 1990
|
|
60
|
Incremental evaluation of computational circuits
– Alpern, Hoover, et al.
- 1990
|
|
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.
|
|
28
|
Bjarne Steensgaard. Value dependence graphs: Representation without taxation
– Weise, Roger, et al.
- 1994
|
|
22
|
A linear time algorithm for placing OE-nodes
– Sreedhar, Gao
- 1995
|
|
21
|
Compact representations for control dependence
– Cytron, Ferrante, et al.
- 1990
|
|
21
|
Generalized dominators and post-dominators
– Gupta
- 1992
|
|
21
|
Flow graph reducibility
– Hecht, Ullman
- 1972
|
|
13
|
Characterizations of reducible flow graphs
– Hecht, Ullman
- 1974
|
|
13
|
A Design for Optimizations of the Bitvectoring Class
– Schwartz, Sharir
- 1979
|
|
12
|
An incremental algorithm for maintaining the dominator tree of a reducible flowgraph
– Ramalingam, Reps
- 1994
|
|
12
|
Incremental computation of dominator trees
– Sreedhar, Gao, et al.
- 1995
|
|
11
|
Incremental data flow update via attribute and dominator updates
– Carroll, Ryder
- 1988
|
|
11
|
DJ-graphs and their applications to flowgraph analyses
– Gao, Lee, et al.
- 1994
|
|
10
|
Incremental computation of static single assignment form
– Choi, Sarkar, et al.
- 1996
|
|
9
|
The transitive closure of control dependence: the iterated join
– Weiss
- 1992
|
|
6
|
Algorithm 430: Immediate predominators in a directed graph
– PURDOM, MOORE
- 1972
|
|
5
|
Computing OE-nodes in linear time using DJ-graphs
– Sreedhar, Gao
- 1993
|
|
4
|
The program tree structure: Computing control regions in linear time
– Johnson, Pearson, et al.
- 1994
|
|
3
|
Efficient data flow analysis using DJ graphs: Elimination methods revisited
– Sreedhar, Gao, et al.
- 1995
|
|
3
|
Efficient Program Analyses Using DJ Graphs
– Sreedhar
- 1995
|
|
3
|
Flow graph anomalies: What's in a loop
– Wolfe
- 1992
|
|
2
|
Dependence Based Program Analysis
– Johnson
- 1994
|
|
1
|
be the initial set, whose iterated dominance frontiers we are interested. Initially the P iggyBank is empty. Step 1 Deposit all nodes in S into the P iggyBank. Remember that if i is the level number of a node then it is inserted at the index i in the P ig
– Let
|
|
1
|
Sequentializing program dependence graphs for irreducible programs
– Steensgard
- 1993
|
|
1
|
A linear time algorithm for finding dominators in flow graphs and related problems
– DovHarel
- 1985
|
|
1
|
Sequentializing program dependence graphs for irreducible programs
– Steengard
- 1993
|
|
