Open AccessBook
Evaluating Software Complexity Measures
Elaine J. Weyuker
- 22 Oct 2010
914
TL;DR: A set of properties of syntactic software complexity measures is proposed to serve as a basis for the evaluation of such measures, and several are found to fail to possess particularly fundamental properties; this failure calls into question their usefulness in measuring synthetic complexity.
read more
Abstract: A set of properties of syntactic software complexity measures is proposed to serve as a basis for the evaluation of such measures. Four known complexity measures are evaluated and compared using these criteria. This formalized evaluation clarifies the strengths and weaknesses of the examined complexity measures, which include the statement count, cyclomatic number, effort measure, and data flow complexity measures. None of these measures possesses all nine properties, and several are found to fail to possess particularly fundamental properties; this failure calls into question their usefulness in measuring synthetic complexity. >
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Metrics-Based Approach to the Reorganization of Class Hierarchy Structures
TL;DR: A set of quantitative metrics which provide a wav of capturing features of a rough estimation of complexity of class hierarchy structure are defined and suggested, and it is proved that each algorithm is "object-preserving" and never changed before and after applying the algorithm on a class hierarchy.
A Change-Sensitive Complexity Measurement for Business Process Models Based on Control Structure
TL;DR: In this article , the authors proposed a new complexity measurement (CP) based on the control structures, which considers the impact of the number and position of activities in branching structures on the process model complexity, distinguishes the connection forms between branch structures, and defines the complexity of the branching structures.
A Methodology for Mapping Programming Languages to Programming Problems
Jason Lawrence Michlowitz
- 01 Aug 2006
TL;DR: Presented to the Graduate Council of Texas State University–San Marcos in Partial Fulfillment of the Requirements for the Degree Master of Science.
Analyzing the Evolution of Inter-package Dependencies in Operating Systems: A Case Study of Ubuntu
Victor Prokhorenko,Chadni Islam,Muhammad Ali Babar +2 more
TL;DR: DepEx framework discovers detailed package relations and evolutionary changes in OS, enabling improved stability, performance, and functionality.
Measuring Architectural Misfit: A Preliminary Real Life Study
Markus Zeindl,Christian Facchi +1 more
- 01 Dec 2018
TL;DR: This preliminary study aims for initial indication of this phenomenon for a large-scale software project consisting of hundreds of developers spread all over the world and results indicate an increase in misfit.
References
A Complexity Measure
TL;DR: Several properties of the graph-theoretic complexity are proved which show, for example, that complexity is independent of physical size and complexity depends only on the decision structure of a program.
6K
•Book
A complexity measure
Thomas J. McCabe
- 04 Oct 1993
TL;DR: In this paper, a graph-theoretic complexity measure for managing and controlling program complexity is presented. But the complexity is independent of physical size, and complexity depends only on the decision structure of a program.
5.1K
Selecting Software Test Data Using Data Flow Information
S. Rapps,Elaine J. Weyuker +1 more
TL;DR: This paper defines a family of program test data selection criteria derived from data flow analysis techniques similar to those used in compiler optimization, arguing that currently used path selection criteria are inadequate.
1.1K
Related Papers (5)
Shyam R. Chidamber,Chris F. Kemerer +1 more
- 02 Sep 2011
Maurice H. Halstead
- 01 Jan 1977
Norman Fenton,Shari Lawrence Pfleeger +1 more
- 01 Jan 2013