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

DOI10.1108/EB005735MaRDI QIDQ3719804zbMATH OpenOpenAlexFDO

Authors John Fuller, Sidarth Ambardar, N. Parameswaran, S. S. 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

data structuremetricdata flowgraph modeldependency computationsHalstead and McCabe methods of measuring program complexity

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3924114
• Applying Mccabe's complexity measure to multiple-exit programs
• Publication:4896252
• scientific article; zbMATH DE number 838665
• scientific article; zbMATH DE number 51799

Cites work

• scientific article; zbMATH DE number 3592932 (Why is no real title available?)
• A Comparison of Measures of Control Flow Complexity
• A Complexity Measure
• A Measure of Control Flow Complexity in Program Text
• Complexity of computations
• Measuring Improvements in Program Clarity
• Measuring the Psychological Complexity of Software Maintenance Tasks with the Halstead and McCabe Metrics

Cited in

(13)

• Correction of the software science length estimator skewness for `C' language programs
• Estimating structural complexity of programs
• Using software complexity measures to analyze algorithms -- an experiment with the shortest-paths algorithms.
• scientific article; zbMATH DE number 168428 (Why is no real title available?)
• The structured complexity of object-oriented programs
• Reading beside the lines: Using indentation to rank revisions by complexity
• Measuring prime program complexity
• scientific article; zbMATH DE number 3924114 (Why is no real title available?)
• scientific article; zbMATH DE number 936824 (Why is no real title available?)
• Information-theoretic Complexity of Program Specifications
• scientific article; zbMATH DE number 3913694 (Why is no real title available?)
• scientific article; zbMATH DE number 838665 (Why is no real title available?)
• Applying Mccabe's complexity measure to multiple-exit programs

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

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