Enhancing adaptive random testing for programs with high dimensional input domains or failure-unrelated parameters

  • Authors:

  • Fei-Ching Kuo;Tsong Yueh Chen;Huai Liu;Wing Kwong Chan

  • Affiliations:

  • Faculty of Information and Communication Technologies, Swinburne University of Technology, Hawthorn, Australia 3122;Faculty of Information and Communication Technologies, Swinburne University of Technology, Hawthorn, Australia 3122;Faculty of Information and Communication Technologies, Swinburne University of Technology, Hawthorn, Australia 3122;Department of Computer Science, City University of Hong Kong, Hong Kong, China

  • Venue:
  • Software Quality Control
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Adaptive random testing (ART), an enhancement of random testing (RT), aims to both randomly select and evenly spread test cases. Recently, it has been observed that the effectiveness of some ART algorithms may deteriorate as the number of program input parameters (dimensionality) increases. In this article, we analyse various problems of one ART algorithm, namely fixed-sized-candidate-set ART (FSCS-ART), in the high dimensional input domain setting, and study how FSCS-ART can be further enhanced to address these problems. We propose to add a filtering process of inputs into FSCS-ART to achieve a more even-spread of test cases and better failure detection effectiveness in high dimensional space. Our study shows that this solution, termed as FSCS-ART-FE, can improve FSCS-ART not only in the case of high dimensional space, but also in the case of having failure-unrelated parameters. Both cases are common in real life programs. Therefore, we recommend using FSCS-ART-FE instead of FSCS-ART whenever possible. Other ART algorithms may face similar problems as FSCS-ART; hence our study also brings insight into the improvement of other ART algorithms in high dimensional space.