Intervals and Derived Graphs

Theorem: There is a unique partition of a program flow graph into intervals.

After a program graph has been partitioned into intervals, a derived graph ( I, &Gamma I) can be formed as follows:

The process of making derived graphs is continued until a single node is reached. Some graphs are irreducible; these are rare in practice and can be handled by making an artificial duplicate of a node.

Contents    Page-10    Prev    Next    Page+10    Index