Title :
Complexity measure evaluation and selection
Author :
Tian, Jeff ; Zelkowitz, Marvin V.
Author_Institution :
Software Solutions Toronto Lab., IBM, North York, Ont., Canada
fDate :
8/1/1995 12:00:00 AM
Abstract :
A formal model of program complexity developed earlier by the authors is used to derive evaluation criteria for program complexity measures. This is then used to determine which measures are appropriate within a particular application domain. A set of rules for determining feasible measures for a particular application domain are given, and an evaluation model for choosing among alternative feasible measures is presented. This model is used to select measures from the classification trees produced by the empirically guided software development environment of R.W. Selby and A.A. Porter, and early experiments show it to be an effective process
Keywords :
software metrics; software performance evaluation; software quality; software selection; alternative feasible measures; application domain; classification trees; complexity measure evaluation; empirically guided software development environment; evaluation criteria; evaluation model; feasible measures; program complexity measures; Application software; Boundary conditions; Classification tree analysis; Fluid flow measurement; Maintenance; Particle measurements; Programming; Software engineering; Software measurement; Software quality;
Journal_Title :
Software Engineering, IEEE Transactions on