A Complexity Measure
- 1 December 1976
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. SE-2 (4) , 308-320
- https://doi.org/10.1109/tse.1976.233837
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.Keywords
This publication has 4 references indexed in Scilit:
- Hi-PASS: a computer-aided synthesis system for maximally parallel digital signal processing ASICsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- A genealogy of control structuresCommunications of the ACM, 1975
- Analysis of structured programsJournal of Computer and System Sciences, 1974
- Structured Programming with go to StatementsACM Computing Surveys, 1974