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

5 Figures & Tables

Topics

Statistics

01020'03'05'07'09'11'13'15'17
Citations per Year

113 Citations

Semantic Scholar estimates that this publication has 113 citations based on the available data.

See our FAQ for additional information.