Cited by 33Logic, programming, and type systemsTeaching and Learning ProgrammingSoftware Engineering Research

The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.

Multiple exits from a loop without the GOTO

Open access
Bochmann, G. V.·1973·Communications of the ACM

Abstract

For several years, there has been discussion about the use of the goto statement in programming languages [1, 2]. It has been pointed out that goto free programs tend to be easier to understand, allow better optimization by the compiler, and are better suited for an eventual proof of correctness. On the other hand, the goto statement is a flexible tool for many programmers. Most programming languages have constructs which allow the programmer to write control flows that occur frequently without the use of a goto . In particular, the language Pascal [3] contains, besides the goto , the following control structures: if-then-else , case , while-do , repeat-until , stepping loop. Wulf [4] has described the use of the construct “ leave 〈label〉” in the language Bliss, where 〈label〉 is the name of a program section which is exited when the statement is executed. It is important to note that these constructs are invented to describe control flows that occur frequently in programs. They describe the flow on a higher level [5] than an equivalent construction using a goto would do.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/362280.362300

Cites

5 of 5 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 5 references

Research works printed but not linked: 3

  1. SIGPLAN 4. The go to controversy. Proc. ACM Ann. Conf., 1972, ACM, New York.
  2. Wulf, W.A. Programming without the go to. Proc. 1971 IFIP Congress, Ljubljana, Yugovlania, Aug. 1971.
  3. Knuth, D.E., and Floyd, R.W. Notes on avoiding "goto" statements. In Information Processing Letters 1. North-Holland Pub. Co., Amsterdam, 1971, pp. 23-31.

Cited by

Sorted by citations

Metadata

Authors
Bochmann, G. V.
Affiliations
Université de Montréal (CA)
Corresponding author
Bochmann, G. V.
Venue
Communications of the ACM
Published
1973-07
Volume
16
Issue
7
Pages
443-444
ISSN
  • 0001-0782 (ISSN-L)
  • 1557-7317
OpenAlex
W2136587738
Cited by
33
References
5
Citations by year
2017: 1 · 2014: 1
FWCI
9.28
Type
journal article
Language
en
Open access
Locations
Communications of the ACM (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Software › Logic, programming, and type systems
  • Physical Sciences › Computer Science › Computer Science Applications › Teaching and Learning Programming
  • Physical Sciences › Computer Science › Information Systems › Software Engineering Research
Keywords
goto statements, control flow, Pascal, structured programming, control structures, program correctness

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review