A Simple , Fast Dominance Algorithm

@inproceedings{Cooper2001AS,
  title={A Simple , Fast Dominance Algorithm},
  author={Keith D. Cooper and Timothy J. Harvey and Ken Kennedy},
  year={2001}
}
The problem of finding the dominators in a control-flow graph has a long history in the literature. The original algorithms suffered from a large asymptotic complexity but were easy to understand. Subsequent work improved the time bound, but generally sacrificed both simplicity and ease of implementation. This paper returns to a simple formulation of dominance as a global data-flow problem. Some insights into the nature of dominance lead to an implementation of an O(N) algorithm that runs… CONTINUE READING
Highly Cited
This paper has 112 citations. REVIEW CITATIONS

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
70 Extracted Citations
32 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

113 Citations

01020'04'07'10'13'16
Citations per Year
Semantic Scholar estimates that this publication has 113 citations based on the available data.

See our FAQ for additional information.

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 32 references

Graph-theoretic constructs for program flow analysis

  • Frances E. Allen, John Cocke
  • Technical Report RC
  • 1972
Highly Influential
9 Excerpts

Advanced Compilation for Vector and Parallel Computers

  • Randy Allen, Ken Kennedy
  • 2001
1 Excerpt

Value numbering

  • K. D. Cooper P. Briggs, L. T. Simpson.
  • Software – Practice and Experience
  • 1999

Similar Papers

Loading similar papers…