Article Sidebar
Keywords:
Article Details
The copyright of a submitted article is only transferred to the publishers if and when the article is accepted for publication. All rights reserved. No part of this publication may be reproduced, stored in a retrieval system or transmitted in any form or by any means, electronic, electrostatic, mechanical, photocopying, recording or otherwise without the prior written permission of the publishers.
Main Article Content
Static Test Compaction As A Minimum Covering Problem
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.
Keywords: test compaction, test stimuli, minimum covering problem, essential test selection, re-dundant test elimination
