Applying Mccabe's complexity measure to multiple-exit programs

DOI10.1002/SPE.4380141009MaRDI QIDQ3334078zbMATH OpenOpenAlexWikidataFDO

Authors Warren A. Harrison

Publication date 1984

Published in Software: Practice and Experience (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/spe.4380141009

zbMATH Keywords

complexity metricscyclomatic complexityMcCabe's complexity metricmultiple-exit programsshort-cut calculation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• A COMPARISON OF A NEW MEASURE OF LOGICAL COMPLEXITY OF PROGRAMS WITH THE HALSTEAD AND McCABE METHODS
• scientific article; zbMATH DE number 3924114
• scientific article; zbMATH DE number 5052319
• scientific article; zbMATH DE number 838665
• Publication:4896252

Cited in

(3)

• A note on an expressiveness hierarchy for multi-exit iteration
• A note on the complexity of program evaluation
• A COMPARISON OF A NEW MEASURE OF LOGICAL COMPLEXITY OF PROGRAMS WITH THE HALSTEAD AND McCABE METHODS

This page was built for publication: Applying Mccabe's complexity measure to multiple-exit programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3334078)