Software errors and complexity: an empirical investigation0
Communications of the ACM
Evaluating Software Complexity Measures
IEEE Transactions on Software Engineering
Object oriented design with applications
Object oriented design with applications
Software complexity: measures and methods
Software complexity: measures and methods
Comments on 'A Metrics Suite for Object Oriented Design'
IEEE Transactions on Software Engineering
A Metrics Suite for Object Oriented Design
IEEE Transactions on Software Engineering
Measurement Theory and Software Measures
Proceedings of the BCS-FACS Workshop on Formal Aspects of Measurement
A framework for developing measurement systems and its industrial evaluation
Information and Software Technology
ECOOP'07 Proceedings of the 2007 conference on Object-oriented technology
Hi-index | 0.00 |
The foundations of the properties of object-oriented software measures are presented. The criteria for these measures are characterized with several binary operations between objects, classes, methods, etc. Binary operations can be used as a tool to give numbers an interpretation above the ordinal scale level. The result of our investigation is that software measures for object-oriented programs mostly do not assume an extensive structure. In order to obtain qualitative criteria for object-oriented measures, the Dempster-Shafer belief function, the Kolmogoroff axioms and the DeFinetti axioms are introduced. These axioms give qualitative criteria for the use of object-oriented software measures between the weak order and the extensive structure.