A nesting level complexity measure
- 1 September 1982
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 17 (9) , 44-50
- https://doi.org/10.1145/947955.947960
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- A topological analysis of the complexity of computer programs with less than three binary branchesACM SIGPLAN Notices, 1981
- A complexity measure based on nesting levelACM SIGPLAN Notices, 1981
- A perspective on software scienceIBM Systems Journal, 1981
- Cyclomatic numbers do not measure complexity of unstructured programsInformation Processing Letters, 1979
- Measurement of program complexity by the pairACM SIGPLAN Notices, 1978
- A Review and Evaluation of Software ScienceACM Computing Surveys, 1978
- An investigation into the effects of the counting method used on software science measurementsACM SIGPLAN Notices, 1978
- An extension to the cyclomatic measure of program complexityACM SIGPLAN Notices, 1977
- A Complexity MeasureIEEE Transactions on Software Engineering, 1976