Author(s)

F.T. Chan, T.Y. Chen, I.K. Mak & Y.T. Yu

Abstract

It has been proved by Weyuker and Jeng [4] that partition testing is more effective than random testing when all partitions are of equal sizes and equal number of test cases are selected from each partition. This result has been generalized by Chen and Yu [1] to partitions of variable sizes. They found that as long as the number of test cases selected from each partition is proportional to the size of the partition, partition testing is still more effective. The latter result is more applicable, as common testing strategies, such as path testing, usually divide the program domain into partitions of unequal sizes. In this paper, we discuss how these theoretical results can be applied

Keywords