VPPS-ART: An Efficient Implementation of Fixed-Size-Candidate-Set Adaptive Random Testing using Vantage Point Partitioning Strategy

by   Rubing Huang, et al.

As an enhanced version of Random Testing (RT), Adaptive Random Testing (ART) aims to improve the failure detection effectiveness of RT by distributing the test cases more evenly in the input domain. Many ART algorithms have been proposed based on different criteria. Among them, the Fixed-Size-Candidate-Set ART (FSCS-ART) is one of the most effective and classical algorithms. FSCS-ART ensures high failure detection effectiveness using selecting the candidate test case which farthest from the previously executed test cases as the next test case. Although FSCS-ART has good failure detection effectiveness, it also has some drawbacks, such as computational overhead problem. In this paper, we propose an enhanced version of FSCS-ART, namely Vantage Point Partitioning Strategy based ART (VPPS-ART). VPPS-ART attempts to solve the computational overhead problem of FSCS-ART using vantage point partitioning strategy and ensures the failure detection effectiveness of FSCS-ART. VPPS-ART achieves the partitioning of the input domain space by using a Vantage Point tree (VP-tree) and finds the nearest executed test cases of a candidate test case in the partitioned sub-domains, which reduces the time overhead significantly compared to the entire input domain search computation. Besides, to match the dynamic insertion process of FSCS-ART, we modify the structure of the traditional VP-tree to support dynamic data. The simulation results present that VPPS-ART has a great lower time overhead compared to FSCS-ART, and also guarantees similar or better failure detection effectiveness than FSCS-ART. The VPPS-ART also shows strength in comparison with the KDFC-ART algorithms, a series of enhanced ART algorithms based on KD-tree. Our empirical studies also reveal that VPPS-ART is more cost-effective compared to FSCS-ART and KDFC-ART.



There are no comments yet.


page 1


A Taxonomic Review of Adaptive Random Testing: Current Status, Classifications, and Issues

Random testing (RT) is a black-box software testing technique that tests...

A Taxonomic Review of Adaptive Random Testing for Numeric Programs

Random testing (RT) is a black-box software testing technique that tests...

Extending Hierarchical Delta Debugging with Hoisting

Minimizing failing test cases is an important pre-processing step on the...

A Survey on Adaptive Random Testing

Random testing (RT) is a well-studied testing method that has been widel...

Identification of Failure Regions for Programs with Numeric Inputs

Failure region, where failure-causing inputs reside, has provided many i...

Enhancing Path-Oriented Test Data Generation Using Adaptive Random Testing Techniques

In this paper, we have developed an approach to generate test data for p...

Machine Learning Testing in an ADAS Case Study Using Simulation-Integrated Bio-Inspired Search-Based Testing

This paper presents an extended version of Deeper, a search-based simula...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.