An efficient incremental algorithm for maintaining dominator trees and its application to $phi$-nodes Update

Data flow analysis based on incremental approach may require that the dominatortree be correctly maintained at all times [CR88]. Previous solutions to theproblem of incrementally maintaining dominator trees were restricted to reducibleflowgraphs [RR94, CR88]. In this paper we present a new algorithm for incrementallymaintaining the dominator tree of an arbitrary flowgraph, both reducible andirreducible, based on a program representation called the DJ-Graph [SG94, SGL94].For the case where ...