An Experimental Study of Software Complexity Metrics for Object- Oriented Programs

碩士 === 國立交通大學 === 資訊工程研究所 === 81 === Object-Oriented programming (approach) has been recognized prevalently and increasingly for its advantages of producing more reusable programs and reducing developing time. Complexity was commonly used a...

Full description

Bibliographic Details
Main Authors: Bin-Shiang Liang, 梁賓先
Other Authors: Feng-Jian Wang
Format: Others
Language:en_US
Published: 1993
Online Access:http://ndltd.ncl.edu.tw/handle/04500063203682078684
Description
Summary:碩士 === 國立交通大學 === 資訊工程研究所 === 81 === Object-Oriented programming (approach) has been recognized prevalently and increasingly for its advantages of producing more reusable programs and reducing developing time. Complexity was commonly used as an attribute for assessing the resources spent and for predicting reliability and maintainability of a program. We have developed a set of complexity metrics, based on information flow, for object-oriented programs. This thesis presents an experimental study designed to validate the metrics. The experiment was conducted to calculate the complexity and development cost of methods, classes, class hierarchies, and programs in C++ language. The results show that the complexity of a program entity that is measured by the proposed metrics is correlated with and sensitive to the efforts, number of errors, and number of changes of the entity during programming development. The complexity measurement of class hierarchy and system seems better to be done by summing from the complexity of their component methods or classes.