Letters to the editor: go to statement considered harmful
Communications of the ACM
Letters to the editor: The go to statement reconsidered
Communications of the ACM
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
Proceedings of a symposium on Compiler optimization
Global common subexpression elimination
Proceedings of a symposium on Compiler optimization
Analysis of structured programs
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Displaying dependence graphs: a hierarchical approach
Journal of Software Maintenance and Evolution: Research and Practice
From program verification to program synthesis
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Synthesis of test scenarios using UML activity diagrams
Software and Systems Modeling (SoSyM)
The beauty and the beast: separating design from algorithm
Proceedings of the 25th European conference on Object-oriented programming
A study of irreducibility in C programs
Software—Practice & Experience
Dominators, directed bipolar orders, and independent spanning trees
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Intermediate representations in imperative compilers: A survey
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
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 transformation 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.