Adaptive random testing by bisection with restriction

Abstract

Random Testing is a strategy to select test cases based on pure randomness. Adaptive Random Testing (ART), a family of algorithms, improves pure Random Testing by taking common failure pattern into account. The best - in terms of the number of test cases necessary to detect the first failure - ART algorithms, however, are too runtime inefficient. Therefore, a modification of a fast, but not so good ART algorithm, namely ART by Bisection, is presented. This modification requires much less test cases than the original method while retaining its computational efficiency. © Springer-Verlag Berlin Heidelberg 2005.