On loops, dominators, and dominance frontier

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2000, Pages 233-241

  Ramalingam, G ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DATA FLOW ANALYSIS; DATA STRUCTURES; GRAPHIC METHODS; LINEAR SYSTEMS; PROGRAM COMPILERS;

ACYCLIC GRAPH; DOMINATOR TREE; ITERATED DOMINANCE FRONTIER; LINEAR TIME ALGORITHM; LOOP NESTING FOREST; SPARSE EVALUATION GRAPH;

ALGORITHMS;

EID: 0034448304     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/349299.349330     Document Type: Conference Paper

References (20)

1. Dominators in linear time
2. A simple and optimal algorithm for finding immediate dominators in reducible graphs
3. Dominators in linear time
4. A new, simpler linear-time dominators algorithm
5. Automatic construction of sparse data flow evaluation graphs
6. Code motion of control structures in high-level languages
7. Efficiently computing static single assignment form and control dependence graph
8. Data structure for weighted matching and nearest common ancestors with linking
9. Nesting of reducible and irreducible loops
10. A fast algorithm for finding dominators in a flowgraph
11. Optimal control dependence computation and the roman chariots problem
12. Identifying loops in almost linear time
13. On loops, dominators, and dominance frontiers
14. An incremental algorithm for maintaining the dominator tree of a reducible flowgraph
15. A linear time algorithm for placing φ-nodes
16. Identifying loops using DJ graphs
17. Sequentializing program dependence graphs for irreducible programs
18. Testing flow graph reducibility
19. The transitive closure of control dependence: The iterated join