Adaptive random testing

312Citations
Citations of this article
56Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we introduce an enhanced form of random testing called Adaptive Random Testing. Adaptive random testing seeks to distribute test cases more evenly within the input space. It is based on the intuition that for non-point types of failure patterns, an even spread of test cases is more likely to detect failures using fewer test cases than ordinary random testing. Experiments are performed using published programs. Results show that adaptive random testing does outperform ordinary random testing significantly (by up to as much as 50%) for the set of programs under study. These results are very encouraging, providing evidences that our intuition is likely to be useful in improving the effectiveness of random testing. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Chen, T. Y., Leung, H., & Mak, I. K. (2004). Adaptive random testing. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3321, 320–329. https://doi.org/10.1007/978-3-540-30502-6_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free