Among the various software metrics, the complexity measure has turned out to be the most objective and quantitative measure to be used for the control of a software project. In this thesis, we suggest a new hybrid complexity measure CX based on information derived from the acyclic paths of programs an the size of difinition-use chains.
To investigate characteristics of the proposed measure and compare its properties with those of the existing measures, we have implemented tools to calculate C X, LOC, NPATH and the token count for the gotoless C programs. Using these tools, we have calculate each metrics and studied the correlations between these measures.
