Discrimination Analysis for Predicting Defect-Prone Software Modules

Table 3

Software metrics.

Type	Description or formula
Mccabe	CYCLOMATIC_COMPLEXITY: 𝑣(𝐺)=𝑒−𝑛+2;
	ESSENTIAL_COMPLEXITY: 𝑒𝑣(𝐺);
	DESIGN_COMPLEXITY: 𝑖𝑣(𝐺);
	LOC_TOTAL;
Halstead	NUM_OPERANDS: 𝑁1
	NUM_OPERATORS: 𝑁2
	NUM_UNIQUE_OPERANDS: 𝜇1
	NUM_UNIQUE_OPERATORS: 𝜇2
	CONTENT: 𝐼=𝐿∗𝑉=(2/𝜇1)∗(𝜇2/𝑁2)
	DIFFICULTY: 𝐷=1/𝐿
	EFFORT: 𝐸=𝑣/𝐿
	ERROR_EST
	LENGTH: 𝑁=𝑁1+𝑁2
	LEVEL: 𝑉^⋆/𝑉=2+𝜇^⋆2log22+𝜇^⋆2
	PROG_TIME: 𝑇=𝐸/18 seconds
	VOLUME: 𝑉=𝑁log2(𝜇)
Loc	LOC_BLANK
	LOC_CODE_AND_COMMENT
	LOC_COMMENTS
	LOC_EXECUTABLE
	NUMBER_OF_LINES
Other	NODE_COUNT: number of nodes found in a given module, 𝑛
	EDGE_COUNT: words and phrases must be provided, 𝑒.
	BRANCH_COUNT
	CALL_PAIRS
	CONDITION_COUNT
	CYCLOMATIC_DENSITY
	DECISION_COUNT: number of decision points in a given module
	DESIGN_DENSITY: 𝑖𝑣(𝐺)/𝑣(𝐺)
	ESSENTIAL_DENSITY: (𝑒𝑣(𝐺)−1)/(𝑣(𝐺)−1)
	PARAMETER_COUNT
	GLOBAL_DATA_COMPLEXITY
	GLOBAL_DATA_DENSITY
	MAINTENANCE_SEVERITY: 𝑒𝑣(𝐺)/𝑣(𝐺)
	MODIFIED_CONDITION_COUNT
	MULTIPLE_CONDITION_COUNT
	NORMALIZED_CYLOMATIC_COMPLEXITY
	PERCENT_COMMENTS