Can structured programs be efficient?

Authors:
R. A. DeMillo;S. C. Eisenstat;R. J. Lipton
Affiliations:
University of Wisconsin-Milwaukee, Milwaukee, WI;Yale University, New Haven, CT;Yale University, New Haven, CT
Venue:
ACM SIGPLAN Notices
Year:
1976

Citing 5
Cited 4

The Expression of Algorithms by Charts

Journal of the ACM (JACM)
Structured Programming with go to Statements

ACM Computing Surveys (CSUR)
On the capabilities of while, repeat, and exit statements

Communications of the ACM
Flow diagrams, turing machines and languages with only two formation rules

Communications of the ACM
The complexity of control structures and data structures

STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing

Applications of high level control flow

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Splitting the Difference: The Historical Necessity of Synthesis in Software Engineering

IEEE Annals of the History of Computing
Program optimization for a pipelined machine a case study

SIGMETRICS '84 Proceedings of the 1984 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Optimal code from flow graphs

Computer Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

By using a new method for comparing the power of control structures, we give evidence that there are provable quantitative differences among various control structures. The key result discussed in this note states that there are natural goto programs which can only be simulated by structured programs that are either very large or very slow.