Complexity measure evaluation and selection
| Title | Complexity measure evaluation and selection |
| Publication Type | Journal Articles |
| Year of Publication | 1995 |
| Authors | Tian J, Zelkowitz MV |
| Journal | Software Engineering, IEEE Transactions on |
| Volume | 21 |
| Issue | 8 |
| Pagination | 641 - 650 |
| Date Published | 1995/08// |
| ISBN Number | 0098-5589 |
| Keywords | alternative, complexity, criteria;evaluation, development, domain;classification, environment;evaluation, evaluation;empirically, evaluation;software, feasible, guided, measure, measures;application, measures;program, measures;software, metrics;software, model;feasible, performance, quality;software, selection;, software, trees;complexity |
| 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 |
| DOI | 10.1109/32.403788 |