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.
Cited by 173 works. doi:10.1137/0201014
Authors
References
- Letters to the editor: go to statement considered harmful
- Control flow analysis
- Global common subexpression elimination
- A global flow analysis algorithm
- Linear and Context-Free Graph Grammars
- Structure and meaning of elementary programs
- Letters to the editor: The go to statement reconsidered
- Algorithmic approximations