By Topic

On the test allocations for the best lower bound performance of partition testing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chen, T.Y. ; Dept. of Comput. Sci., Melbourne Univ., Parkville, Vic., Australia ; Yu, Y.T.

A partition testing strategy divides the program's input domain into subdomains according to a partitioning scheme, and selects test cases from each subdomain according to a test allocation scheme. Previous studies have shown that partition testing strategies can be very effective or very ineffective in detecting faults, depending on both the partitioning scheme and the test allocation scheme. Given a partitioning scheme, the maximin criterion chooses a test allocation scheme that will maximally improve the lower bound performance of the partition testing strategy. In an earlier work, we have proved that the Basic Maximin Algorithm can generate such a test allocation scheme. In this paper, we derive further properties of the Basic Maximin Algorithm and present the Complete Maximin Algorithm that generates all possible test allocation schemes that satisfy the maximin criterion

Published in:

Software Engineering Conference, 1998. Proceedings. 1998 Australian

Date of Conference:

9-13 Nov 1998