KNUSTSpace >
Journal of Science and Technology (JUST) >
Journal of Science and Technology 2000- >

Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/4988

Title: Static Test Compaction as a Minimum Covering Problem
Authors: Boateng, K.O.
Keywords: test compaction
test stimuli
minimum covering problem
essential test selection
re-dundant test elimination
Issue Date: 2009
Publisher: Journal of Science and Technology
Citation: Journal of Science and Technology, Vol. 29, No. 3 (2009), pp 126-135
Abstract: Large numbers of test stimuli impact on the time and cost of test application. Hence there is the need to keep numbers of test stimuli low while maintaining as high fault coverage as possible. In this paper, static compaction of test stimuli is seen as a minimization problem. The task of static compaction of a set of test stimuli has been formulated as a minimum covering problem. Based on the concept of minimization, a method of static compaction has been developed. Results of experiments conducted to evaluate the method are also presented. The method achieved a sig-nificant compaction of sets of test stimuli that had previously been compacted by means of a test generation algorithm that features dynamic compaction.
Description: Journal of Science and Technology, Vol. 29, No. 3 (2009), pp 126-135
URI: http://hdl.handle.net/123456789/4988
Appears in Collections:Journal of Science and Technology 2000-

Files in This Item:

File Description SizeFormat
Boateng.pdf392.7 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback