Flow Graph Reducibility

Authors:
  • MHMatthew S. Hecht
    Matthew S. Hecht
  • JUJeffrey D. Ullman
    Jeffrey D. Ullman

Abstract
The structure of , programs can often be described by a technique called “interval analysis” on their flow graphs. Here, we characterize the set of flow graphs that can be analyzed in this way in terms of two very simple transformations on graphs. We then give a necessary and sufficient condition for analyzability and apply it to “goto-less programs,” showing that they all meet the criterion.

This publication has 9 references indexed in Scilit: