Efficient data flow analysis using DJ-graphs: Elimination methods revisited

In this paper we present a new approach to elimination based data flow analysisthat uses a program representation called the DJ Graph. The skeleton of the DJgraph of a program is the dominator tree of its flowgraph (whose edges are calledD edges in this paper), and the tree skeleton is augmented with join edges (called Jedges in this paper). Unlike the previous elimination methods, which first reduce aflowgraph to a single node, our approach only eliminate J edges from the DJ graph ina...