• DocumentCode
    2355656
  • Title

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

  • Author

    Zhuo, Jianqiang ; Pichai, Ramkumar ; Sahni, Sujay ; Oman, Paul W.

  • Author_Institution
    Microsoft Corp., Redmond, WA, USA
  • fYear
    1998
  • fDate
    20-21 Nov 1998
  • Firstpage
    258
  • Lastpage
    266
  • Abstract
    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
  • Keywords
    object-oriented programming; program testing; software metrics; C++; cyclomatic complexity; engineering quality circle; object-oriented code; object-oriented software development; relative test complexity validation; software managers; source code turmoil; test resources; Computer industry; Engineering management; Lab-on-a-chip; Object oriented modeling; Programming; Resource management; Size measurement; Software development management; Software testing; System testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Software Metrics Symposium, 1998. Metrics 1998. Proceedings. Fifth International
  • Conference_Location
    Bethesda, MD
  • Print_ISBN
    0-8186-9201-4
  • Type

    conf

  • DOI
    10.1109/METRIC.1998.731252
  • Filename
    731252