Intervals
An interval is a subgraph that basically corresponds to a program loop.
An interval I with initial node h is the maximal subgraph (I, &Gamma_{I}) of (S, &Gamma) such that:
To construct an interval starting with node h :
Members of &Gamma I - I must be the heads of other intervals.