10.12.2012 Views

Domain Testing: Divide and Conquer - Testing Education

Domain Testing: Divide and Conquer - Testing Education

Domain Testing: Divide and Conquer - Testing Education

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

There have been several discussions in the literature about the relative<br />

merits of partition testing <strong>and</strong> pure r<strong>and</strong>om testing. Pure r<strong>and</strong>om testing is not<br />

r<strong>and</strong>om selection of test cases from subdomains, but is just r<strong>and</strong>om selection of test<br />

cases from the entire input domain without forming any partitions. R<strong>and</strong>om <strong>and</strong><br />

partition testing have been found to be better than each other under certain<br />

conditions, <strong>and</strong> the two are almost equivalent under certain other conditions.<br />

Proportional partition testing has mostly been discussed as a method that<br />

evolved in order to improve partition testing <strong>and</strong> to make its effectiveness at<br />

finding failures greater than that of r<strong>and</strong>om testing. Weyuker <strong>and</strong> Jeng (1991) noted<br />

that when the original partition testing method is refined so that we form all<br />

subdomains of equal size <strong>and</strong> then select an equal number of test cases from each<br />

subdomain, pure r<strong>and</strong>om testing can never beat partition testing in terms of<br />

effectively finding failures. This is assuming that either the number of subdomains<br />

formed is very large or the number of test cases chosen from each subdomain is<br />

very large compared to the size of the subdomain itself.<br />

Chan et al. (1998) cited a modified version of the proportional partition<br />

testing method that somewhat blends the refined version of partition testing<br />

described by Weyuker <strong>and</strong> Jeng (1991) with the traditional proportional partition<br />

testing method.<br />

Chan et al. (1998) called their method the Optimally Refined Proportional<br />

Sampling (ORPS) strategy. This method involves partitioning the input domain into<br />

equally sized partitions as described by Weyuker <strong>and</strong> Jeng (1991), <strong>and</strong> then<br />

selecting one test case at r<strong>and</strong>om from each equally sized subdomain.<br />

Chan et al. (1998) noted that the results of trying out their ORPS strategy on<br />

several programs seemed positive enough to recommend this method as a<br />

subdomain testing strategy.<br />

Ntafos (1998) has illustrated an experiment in which he compared r<strong>and</strong>om<br />

testing with proportional partition testing. When doing proportional partition<br />

testing, he considered 50 subdomains. He applied the two strategies to 50 test cases<br />

to start with, <strong>and</strong> then increased to 2,000 total test cases in increments of 50 cases.<br />

26

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!