Skip to content

A Complexity Measure

Thomas J. McCabe

IEEE Transactions on Software Engineering · 1976 · 6,282 citations

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

McCabe, T. J. (1976). A complexity measure. IEEE Transactions on Software Engineering, SE-2(4), 308–320. https://doi.org/10.1109/tse.1976.233837

In text: (McCabe, 1976)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

Abstract

This paper describes a graph-theoretic complexity measure and illustrates how it can be used to manage and control program complexity. The paper first explains how the graph-theory concepts apply and gives an intuitive explanation of the graph concepts in programming terms. The control graphs of several actual Fortran programs are then presented to illustrate the correlation between intuitive complexity and the graph-theoretic complexity. Several properties of the graph-theoretic complexity are then proved which show, for example, that complexity is independent of physical size (adding or subtracting functional statements leaves complexity unchanged) and complexity depends only on the decision structure of a program.

  1. Julia: A Fresh Approach to Numerical Computing2017
  2. A relational model of data for large shared data banks1970
  3. A relational model of data for large shared data banks1983
  4. An axiomatic basis for computer programming1969

Metadata from OpenAlex (CC0). Citations are generated from the published record.