A COMPARISON OF A NEW MEASURE OF LOGICAL COMPLEXITY OF PROGRAMS WITH THE HALSTEAD AND McCABE METHODS
From MaRDI portal
Publication:3719804
DOI10.1108/EB005735zbMATH Open0591.68020OpenAlexW2060185942MaRDI QIDQ3719804FDOQ3719804
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
Recommendations
data structuremetricdata flowgraph modeldependency computationsHalstead and McCabe methods of measuring program complexity
Cites Work
- A Complexity Measure
- Title not available (Why is that?)
- Measuring the Psychological Complexity of Software Maintenance Tasks with the Halstead and McCabe Metrics
- Complexity of computations
- A Comparison of Measures of Control Flow Complexity
- A Measure of Control Flow Complexity in Program Text
- Measuring Improvements in Program Clarity
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.
- Title not available (Why is that?)
- The structured complexity of object-oriented programs
- Reading beside the lines: Using indentation to rank revisions by complexity
- Measuring prime program complexity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Information-theoretic Complexity of Program Specifications
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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)
