The DOI matches its Crossref record.
A Measure of Control Flow Complexity in Program Text
Abstract
This paper discusses the need for measures of complexity and unstructuredness of programs. A simple language independent concept is put forward as a measure of control flow complexity in program text and is then developed for use as a measure of unstructuredness. The proposed metric is compared with other metrics, the most notable of which is the cyclomatic complexity measure. Some experience with automatic tools for obtaining these metrics is reported.
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.
Integrity signals
Registry
Cites
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.
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
Cited by
Evaluating software complexity measures
Weyuker, E. J. (1988) · IEEE Transactions on Software Engineering · doi:10.1109/32.6178 · Cited by 847
A critique of cyclomatic complexity as a software metric
Shepperd, M. (1988) · Software Engineering Journal · doi:10.1049/sej.1988.0003 · Cited by 240
Landman, D., Serebrenik, A., Bouwers, E., & Vinju, J. J. (2016) · Journal of Software: Evolution and Process · doi:10.1002/smr.1760 · Cited by 29
Metadata
- Authors
- Woodward, M. R., Hennell, M. A., & Hedley, D.
- Venue
- IEEE Transactions on Software Engineering
- Published
- 1979-01
- Volume
- SE-5
- Issue
- 1
- Pages
- 45-50
- ISSN
- 0098-5589 (ISSN-L)
- OpenAlex
- W1976511128
- Cited by
- 196
- References
- 0
- FWCI
- 55.58
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Measure of Control Flow Complexity in Program Text. https://app.cochat.ai/papers/10.1109/tse.1979.226497
- The paper
- Woodward, M. R., Hennell, M. A., & Hedley, D. (1979). A Measure of Control Flow Complexity in Program Text. IEEE Transactions on Software Engineering. https://doi.org/10.1109/tse.1979.226497
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.