Home // VALID 2013, The Fifth International Conference on Advances in System Testing and Validation Lifecycle // View article

Preliminary Test Suite Reduction

Authors:
Vitaly Kozyura
Sebastian Wieczorek

Keywords: MBT; test suite reduction; industrial case study

Abstract:
Test suite reduction is an activity which reduces test suites while maintaining their coverage properties. This problem is equivalent to the set covering problem and therefore NP-complete. Many strategies for solving the problem are known. They are usually applied to minimizing the number of action calls within a given test suite for a certain coverage goal. While some algorithms like branch and bound compute an exact minimal solution, other algorithms like the greedy approach compute an approximation for the minimal set of actions. In this work, we deal with the problem of efficient test suite reduction in industrial practice. For this purpose, we introduce the concept of preliminary test suite reduction. Its aim is to reduce redundancy in test suites before starting the actual reduction. In the paper, we further describe experimental results that give implication on how the proposed technique can reduce the runtime of test suite reduction in the industrial practice.

Pages: 33 to 38

Copyright: Copyright (c) IARIA, 2013

Publication date: October 27, 2013

Published in: conference

ISSN: 2308-4316

ISBN: 978-1-61208-307-0

Location: Venice, Italy

Dates: from October 27, 2013 to October 31, 2013