Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Hecht et al. (1972) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: