Rated and operating complexity of program—an extension to McCabe's theory of complexity measure

Authors:
M. M. Sagri
Affiliations:
Reliability & Quality Assurance, Space Applications Centre, Indian Space Research Organisation, Ahmedabad 380 053, India
Venue:
ACM SIGPLAN Notices
Year:
1989

Citing 2
Cited 2

Structured programming techniques: a study of relative complexity

Computers & Education
An extension to the cyclomatic measure of program complexity

ACM SIGPLAN Notices

Erhard Konrad: software metrics, measurement theory, and viewpoints-critical remarks on a new approach

ACM SIGPLAN Notices
Technical correspondence

Communications of the ACM - Special issue on information filtering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Program complexity measure is arrived at using graph- theoretic method giving a cyclomatic number. However it has been found that programs with same cyclomatic number do not have same complexity. A simple extension to the measure is described in this paper to arrive at a better understanding of complexity. The program's complexity is divided into rated & operating complexity.