Analysis of structured programs
S. Rao Kosaraju · ACM Symposium on Theory of Computing (STOC) · 1973
We investigate various control structures to understand their computational complexity and limitations. It is generally felt that GOTO-less programs constructed from the classical primitives are very restrictive; structured programming languages like BLISS, however, incorporating Repeat-Exit constructs appear to ease this sense of restrictiveness. In this paper we analyze this construct. We answer a conjecture of Knuth and Floyd as a special case of the general theory. We also investigate a general Top-Down Programming construct, which we call the TDn-construct.
Cited by 34 works. doi:10.1145/800125.804055
Authors
References
- Notes on Structured Programming
- Flow diagrams, turing machines and languages with only two formation rules
- Letters to the editor: go to statement considered harmful
- Mathematical Foundations for Structured Programming
- Flow Graph Reducibility
- Notes on avoiding “go to” statements
- Böhm and Jacopini's reduction of flow charts
- The Expression of Algorithms by Charts