Adaptive Random Testing through Iterative Partitioning with Enlarged Input Domain 


Vol. 15,  No. 4, pp. 531-540, Aug.  2008
10.3745/KIPSTD.2008.15.4.531


PDF
  Abstract

An Adaptive Random Testing(ART) is one of test case generation algorithms, which was designed to get better performance in terms of fault-detection capability than that of Random Testing(RT) algorithm by locating test cases in evenly spreaded area. Two ART algorithms, such as Distance-based ART(D-ART) and Restricted Random Testing(RRT), had been indicated that they have significant drawbacks in computations, i.e., consuming quadratic order of runtime. To reduce the amount of computations of D-ART and RRT, iterative partitioning of input domain strategy was proposed. They achieved, to some extent, the moderate computation cost with relatively high performance of fault detection. Those algorithms, however, have yet the patterns of non-uniform distribution in test cases, which obstructs the scalability. In this paper we analyze the distribution of test cases in an iterative partitioning strategy, and propose a new method of input domain enlargement which makes the test cases get much evenly distributed. The simulation results show that the proposed one has about 3 percent of improvement in terms of mean relative F-measure for 2-dimension input domain, and shows 10 percent improvement for 3-dimension space.

  Statistics


  Cite this article

[IEEE Style]

S. H. Shin and S. K. Park, "Adaptive Random Testing through Iterative Partitioning with Enlarged Input Domain," The KIPS Transactions:PartD, vol. 15, no. 4, pp. 531-540, 2008. DOI: 10.3745/KIPSTD.2008.15.4.531.

[ACM Style]

Seung Hun Shin and Seung Kyu Park. 2008. Adaptive Random Testing through Iterative Partitioning with Enlarged Input Domain. The KIPS Transactions:PartD, 15, 4, (2008), 531-540. DOI: 10.3745/KIPSTD.2008.15.4.531.