The combining DAG: a technique for parallel data flow analysis

Classical data flow problems such as reaching available and busy expressions and definitions use a novel technique to calculate rapid data flow problems in parallel. This method analyzes data flow within linear paths, independent paths and paths that occur within the loop of a control flow graph. A directed acyclic graph (DAG) characterizes this technique, which transforms a cyclic flow graph's cyclic structures to acyclic structures.