Tetsuo Saitou

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
This paper presents a simple and fast algorithm with proof of correctness for analyzing dominance relations of control flow graphs (CFGs). A dominator tree and dominance frontiers are obtained by reducing a DAG, which is obtained by adding dummy vertexes to the original CFG to transmit dominance relation of irreducible loops to the resultant DAG. A specific(More)
  • 1