A Revisit of Adaptive Random Testing by Restriction

  • Authors:

  • Kwok Ping Chan;Tsong Yueh Chen;Fei-Ching Kuo;Dave Towey

  • Affiliations:

  • University of Hong Kong;Swinburne University of Technology;Swinburne University of Technology;University of Hong Kong

  • Venue:
  • COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Adaptive Random Testing is a Black Box testing method based on the intuition that Random Testing failure-finding efficiency can be improved upon, in certain situations, by ensuring a more widespread and evenly distributed spread of test cases in the input domain. One way of achieving this distribution is through the use of exclusion zones and restriction, resulting in a method called Restricted Random Testing (RRT). Recent investigations into the RRT method have revealed several interesting and significant insights. A method of reducing the computational overheads of testing methods by partitioning an input domain, and applying the method to only one of the subdomains, mapping the test cases to other subdomains, has recently been introduced. This method, called Mirroring, in addition to alleviating computational costs, has some properties which fit nicely with the insights into RRT, offering solutions to some possible shortcomings of RRT. . In this paper we discuss the RRT method and additional insights; we explain Mirroring; and we detail applications of Mirroring to RRT. The Mirror RRT method proves to be a very attractive variation of RRT.