A COMPARISON OF A NEW MEASURE OF LOGICAL COMPLEXITY OF PROGRAMS WITH THE HALSTEAD AND McCABE METHODS

DOI10.1108/eb005735zbMath0591.68020OpenAlexW2060185942MaRDI QIDQ3719804

N. Parameswaran, Sidarth Ambardar, John Fuller, S. Sitharama Iyengar

Publication date: 1986

Published in: Kybernetes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1108/eb005735

zbMATH Keywords

metricdata structuredata flowgraph modeldependency computationsHalstead and McCabe methods of measuring program complexity

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Unnamed Item
• A Comparison of Measures of Control Flow Complexity
• A Complexity Measure
• Complexity of computations
• A Measure of Control Flow Complexity in Program Text
• Measuring Improvements in Program Clarity
• Measuring the Psychological Complexity of Software Maintenance Tasks with the Halstead and McCabe Metrics

This page was built for publication: A COMPARISON OF A NEW MEASURE OF LOGICAL COMPLEXITY OF PROGRAMS WITH THE HALSTEAD AND McCABE METHODS