Finding dominators

  • Renata Ochranová
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 158)


Algorithm for the construction of the dominator tree for reducible control flow graphs working in time 0(r) (r is the number of arcs of the graph), is presented.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Lengauer, T., and Tarjan, R.E.: A Fast Algorithm for Finding Dominators in a Flowgraph. ACM Transactions on Programming Languages and Systems, Vol. 1, No. 1, July 1979, 121–141CrossRefGoogle Scholar
  2. [2]
    Purdom, P.W., and Moore, E.F. Algorithm 430: Immediate predominators in a directed graph. Comm. ACM, Vol. 15, No. 8, Aug. 1972, 777–778CrossRefGoogle Scholar
  3. [3]
    Aho, A.V., and Ullman, J.D.: Principles of Compiler Design. Addison-Wesley, Reading, Mass., 1977Google Scholar
  4. [4]
    Tarjan, R.E.: Fast Algorithms for Solving Path Problems JACM, Vol. 28, No. 3, July 1981, 594–614Google Scholar
  5. [5]
    Kohoutková-Nováková, J.: The Conditions of BJn-structuredness, Scripta Fac. Sci. Nat. Univ. Purk. Brun., Vol. 12, No. 10, 1982, 471–480Google Scholar
  6. [6]
    Hecht,M.S.: Flow Analysis of Computer Programs. Elsevier North-Holland, Inc., 1977Google Scholar
  7. [7]
    Moravec, A.: The Base of Control Flow Graph. Scripta Fac. Sci. Nat. Univ. Purk. Brun., Vol. 8, No. 10, 1978, 27–40Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • Renata Ochranová
    • 1
  1. 1.Computing Science Department, Faculty of ScienceJ.E. Purkyně UniversityBrnoCzechoslovakia

Personalised recommendations