|
 ABSTRACT
A recent paper has described a graph-theoretic measure of program complexity, where a program's complexity is assumed to be only a factor of the program's decision structure. However several anomalies have been found where a higher complexity measure would be calculated for a program of lesser complexity than for a more-complex program. This paper discusses these anomalies, describes a simple extension to the measure to eliminate them, and applies the measure to several programs in the literature.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
T. J. McCabe, "A Complexity Measure," <u>IEEE Transactions on Software Engineering</u>, SE-2(4), 308--320 (1976).
|
| |
2
|
|
| |
3
|
|
CITED BY 39
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Gerrit E. DeYoung , Garry R. Kampen , James M. Topolski, Analyzer-generated and human-judged predictors of computer program readability, Proceedings of the 1982 conference on Human factors in computing systems, p.223-228, March 15-17, 1982, Gaithersburg, Maryland, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
G. Michael Schneider , Robert L. Sedlmeyer , Joe Kearney, On the complexity of measuring software complexity, Proceedings of the May 4-7, 1981, national computer conference, May 04-07, 1981, Chicago, Illinois
|
|
|
|
|
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf