Cyclomatic numbers do not measure complexity of unstructured programs
From MaRDI portal
Publication:1151018
DOI10.1016/0020-0190(79)90070-XzbMath0456.68020MaRDI QIDQ1151018
Publication date: 1979
Published in: Information Processing Letters (Search for Journal in Brave)
program transformationscomplexity measuresflowgraphsprogram equivalencecyclomatic numberscomplexity of unstructured programs
Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)
Cites Work
This page was built for publication: Cyclomatic numbers do not measure complexity of unstructured programs