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 transformations; complexity measures; flowgraphs; program equivalence; cyclomatic numbers; complexity of unstructured programs
68Q25: Analysis of algorithms and problem complexity
68Q60: Specification and verification (program logics, model checking, etc.)
68N25: Theory of operating systems
Cites Work