Abstract

Adaptive random testing (ART) has been proposed to enhance the effectiveness of random testing (RT) through more even spreading of the test cases. In particular, restricted random testing (RRT) is an ART algorithm based on the intuition of skipping all the candidate test cases that are within the neighborhoods (or zones) of previously executed test cases. RRT has higher effectiveness than RT in terms of failure detection but incurs a higher time cost. In this paper, we aim to further reduce the time costs for RRT and improve the effectiveness for RT and ART methods. We propose a proactive technique known as “RRT by largest available zone” (RRT-LAZ). Like RRT, RRT-LAZ first defines an exclusion zone around every executed test case in order to determine the available zones. Unlike the original RRT, RRT-LAZ then compares all the available zones to proactively pick the largest one, from which the next test case is randomly generated. Both simulation analyses and empirical studies have been employed to investigate the efficiency and effectiveness of RRT-LAZ in relation to RT and related ART algorithms. The results show that RRT-LAZ has significantly lower time costs than RRT. Furthermore, RRT-LAZ is more effective than RT and related ART methods for block failure patterns in low-dimensional input spaces. In general, since RRT-LAZ employs a proactive technique instead of a passive one in generating next cases, it is much more cost-effective than RRT. RRT-LAZ is also more cost-effective than RT and other ART methods that we have studied.

Highlights

  • The advancement of information technology has triggered an increasing interest in the use of software applications for various activities such as online shopping, mobile apps, and train and taxi booking

  • In view of the shortcomings of restricted random testing (RRT), we propose a proactive algorithm known as RRT by largest available zone (RRTLAZ), which reduces the effort in judging whether a candidate case is selectable

  • WORK Adaptive random testing enhances the effectiveness of random testing by making use of the failure distribution properties of most programs under test

Read more

Summary

BACKGROUND

The advancement of information technology has triggered an increasing interest in the use of software applications for various activities such as online shopping, mobile apps, and train and taxi booking. Making use of the general property that failure-causing inputs tend to be clustered in contiguous regions, Chen et al have proposed an improved method known as adaptive random testing (ART) [7]. ART-RP partitions the input space at the location of every previously executed test case and selects the test case from the largest region. Restricted random testing (RRT) [15], [16] is an ART algorithm based on the idea of exclusion It generates an exclusion zone in the input space around every previously executed test case. RRT repeatedly generates candidate test cases randomly from the input space until a candidate test case falls outside of all the exclusion zones. RRT selects candidate test cases from the whole input domain and discards the candidates that are inside the exclusion regions

RRT-LAZ ALGORITHM FOR ONE-DIMENSIONAL INPUT SPACES
EXPERIMENTAL EVALUATIONS
THREATS TO VALIDITY
FURTHER DISCUSSIONS ON RELATED WORK
Findings
CONCLUSION AND FUTURE WORK
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call