Automatic test generation using checkpoint encoding and antirandom testing

Abstract

The implementation of an e cient automatic test generation scheme for black-box testing environment is discussed. It uses checkpoint encoding and antirandom testing schemes. Checkpoint encoding converts test generation to a binary problem. The checkpoints are selected t o p r obe the input space such that boundary and illegal cases are generated in addition to valid cases. Antirandom testing selects each test case such that it is as di erent as possible from all the previous tests. The implementation is illustrated using benchmark examples that have been used in the literature. Use of random testing both with checkpoint encoding and without is also reported. Comparison and evaluation of the e ectiveness of these methods is also presented. Implications of the observations for larger software systems are noted. Overall, antirandom testing has higher code coverage than encoding random testing, encoding random testing has higher code coverage than pure r andom testing.

Prioritizing test cases with string distances

“…In this paper we propose an alternate and more general way of measuring test case diversity, using standard string distances. This work has also been influenced by the ideas of "anti-random testing" (Malaiya 1995;Yin et al 1997) and "adaptive random testing" (Chen et al 2004). The antirandom testing approach (Malaiya 1995;Yin et al 1997) aims at building a test suite by constructing new test cases which are the most distant possible from existing ones.…”

“…This work has also been influenced by the ideas of "anti-random testing" (Malaiya 1995;Yin et al 1997) and "adaptive random testing" (Chen et al 2004). The antirandom testing approach (Malaiya 1995;Yin et al 1997) aims at building a test suite by constructing new test cases which are the most distant possible from existing ones. The idea of adaptive random testing comes from the work of Chen et al (2004), based on observations of Chan et al (1996) that errors in software are usually clustered and follow several "failure patterns".…”

A Three-Tiered Testing Strategy for Cookies

“…One current approach that can be applied to this problem is anti-random testing [14][15][16]. Anti-random testing, introduced by Malaiya [14], involves the selection of test cases to maximize the Cartesian or Hamming distance from all previous test cases and has been shown to be effective through a series of empirical evaluations [14][15][16].…”

An Effective and Efficient Testing Methodology for Correctness Testing for File Recovery Tools

“…Partition testing, in which a tester divides a system's input domain according to some rule and then tests within the subdomains, is a common software testing approach [9,16,18,8]. On the other hand, random testing, in which a tester randomly tests the system's input domain, is also widely used in software testing [1,5].…”

“…On the other hand, random testing, in which a tester randomly tests the system's input domain, is also widely used in software testing [1,5]. If the fairness and blindness requirements must be fulfilled, partition testing is proven to be better than random testing as shown in [16,18,8,13].…”