Flow Graph Reducibility
Matthew S. Hecht, Jeffrey David Ullman · SIAM Journal on Computing · 1972
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.