Cyclomatic numbers do not measure complexity of unstructured programs

DOI10.1016/0020-0190(79)90070-XMaRDI QIDQ1151018zbMATH OpenFDO

Authors G. Oulsnam

Publication date 1979

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

complexity measuresprogram transformationsflowgraphsprogram equivalencecyclomatic numberscomplexity of unstructured programs

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3640836 (Why is no real title available?)
• A Complexity Measure
• Measuring the Psychological Complexity of Software Maintenance Tasks with the Halstead and McCabe Metrics
• Pascal. User manual and report. 2nd ed

This page was built for publication: Cyclomatic numbers do not measure complexity of unstructured programs

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