Adaptive Random Testing by Bisection with Restriction

2005 ◽  
pp. 251-263 ◽  
Author(s):  
Johannes Mayer
Keyword(s):  
Random Testing ◽  
Adaptive Random Testing

A nearest-neighbor divide-and-conquer approach for adaptive random testing

2021 ◽  
pp. 102743
Author(s):  
Rubing Huang ◽  
Weifeng Sun ◽  
Haibo Chen ◽  
Chenhui Cui ◽  
Ning Yang
Keyword(s):  
Nearest Neighbor ◽  
Divide And Conquer ◽  
Random Testing ◽  
Adaptive Random Testing

Enhancing mirror adaptive random testing through dynamic partitioning

2015 ◽  
Vol 67 ◽  
pp. 13-29 ◽  
Author(s):  
Rubing Huang ◽  
Huai Liu ◽  
Xiaodong Xie ◽  
Jinfu Chen
Keyword(s):  
Random Testing ◽  
Dynamic Partitioning ◽  
Adaptive Random Testing

RESTRICTED RANDOM TESTING: ADAPTIVE RANDOM TESTING BY EXCLUSION

2006 ◽  
Vol 16 (04) ◽  
pp. 553-584 ◽  
Author(s):  
KWOK PING CHAN ◽  
TSONG YUEH CHEN ◽  
DAVE TOWEY
Keyword(s):  
Simple Technique ◽  
Test Case ◽  
Test Cases ◽  
Random Testing ◽  
Testing Methods ◽  
Failure Patterns ◽  
Subsequent Test ◽  
Testing Strategies ◽  
Adaptive Random Testing ◽  
Input Domain

Restricted Random Testing (RRT) is a new method of testing software that improves upon traditional Random Testing (RT) techniques. Research has indicated that failure patterns (portions of an input domain which, when executed, cause the program to fail or reveal an error) can influence the effectiveness of testing strategies. For certain types of failure patterns, it has been found that a widespread and even distribution of test cases in the input domain can be significantly more effective at detecting failure compared with ordinary RT. Testing methods based on RT, but which aim to achieve even and widespread distributions, have been called Adaptive Random Testing (ART) strategies. One implementation of ART is RRT. RRT uses exclusion zones around executed, but non-failure-causing, test cases to restrict the regions of the input domain from which subsequent test cases may be drawn. In this paper, we introduce the motivation behind RRT, explain the algorithm and detail some empirical analyses carried out to examine the effectiveness of the method. Two versions of RRT are presented: Ordinary RRT (ORRT) and Normalized RRT (NRRT). The two versions share the same fundamental algorithm, but differ in their treatment of non-homogeneous input domains. Investigations into the use of alternative exclusion shapes are outlined, and a simple technique for reducing the computational overheads of RRT, prompted by the alternative exclusion shape investigations, is also explained. The performance of RRT is compared with RT and another ART method based on maximized minimum test case separation (DART), showing excellent improvement over RT and a very favorable comparison with DART.

KDFC-ART: a KD-tree approach to enhancing Fixed-size-Candidate-set Adaptive Random Testing

2019 ◽  
Vol 68 (4) ◽  
pp. 1444-1469 ◽  
Author(s):  
Chengying Mao ◽  
Xuzheng Zhan ◽  
T. H. Tse ◽  
Tsong Yueh Chen
Keyword(s):  
Random Testing ◽  
Fixed Size ◽  
Adaptive Random Testing ◽  
Tree Approach ◽  
Candidate Set
Sign in / Sign up

Export Citation Format

Share Document