By Topic

On the validation of relative test complexity for object-oriented code

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Jianqiang Zhuo ; Microsoft Corp., Redmond, WA, USA ; Pichai, R. ; Sahni, S. ; Oman, P.W.

In order to help software managers and engineers allocate test resources in object-oriented software development, the Relative Test Complexity (RTC) metric was proposed and applied to an industrial system developed in C++. The initial validation by an engineering quality circle supported the validity of the RTC metric. In this paper, the RTC metric is further validated using actual fault data. It is shown that the RTC metric is a better surrogate of faults than Relative Complexity (RC), Harrison's Macro-Micro Complexity (MMC), McCabe's cyclomatic complexity (V(g)), Halstead's effort (E), and simple measures of size like LOC. Finally, the RTC and RC models are applied to change data with results that indicate that the RTC and RC metrics can be used to predict source code turmoil

Published in:

Software Metrics Symposium, 1998. Metrics 1998. Proceedings. Fifth International

Date of Conference:

20-21 Nov 1998