Skip Navigation

The Computer Journal 1999 42(5):430-440; doi:10.1093/comjnl/42.5.430
© 1999 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Chen, T. Y.
Right arrow Articles by Lau, M. F.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

On the Completeness of a Test Suite Reduction Strategy

Tsong Yueh ChenA1 and Man Fai LauA2,A3

A1 Department of Computing and Mathematics, Hong Kong Technical College (Chai Wan), Chai Wan, Hong Kong Email: tyc@cs.mu.oz.au A2 Department of Computer Science and Software Engineering, The University of Melbourne, Parkville 3052, Australia A3 Present address: Department of Computing and Mathematics, Hong Kong Technical College (Chai Wan), Chai Wan, Hong Kong

The problem of test suite reduction is to find a subset of test cases from the test suite that can still satisfy the same testing objective. Such a subset is referred to as a representative set of the test suite. We use a problem reduction technique, namely the 1-to-1 redundancy dividing strategy, to find the optimal representative sets, which are the representative sets of the smallest size. The 1-to-1 redundancy dividing strategy guarantees that an optimal representative set of the reduced test suite is still an optimal representative set of the original one. However, the converse is not necessarily true. This paper investigates how to find all optimal representative sets of the original test suite from the reduced one. Furthermore, for the minimal representative sets whose proper subsets are not representative sets, the same problem is addressed.

Received 28 October, 1996. Revised 13 July, 1999.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.