A New Method for Test Suite Reduction
- Resource Type
- Conference
- Authors
- Zhang, Rui; Jiang, Jianhui; Yin, Jie; Jin, Ang; Lou, Jungang; Wu, Ying
- Source
- 2008 The 9th International Conference for Young Computer Scientists Young Computer Scientists, 2008. ICYCS 2008. The 9th International Conference for. :1211-1216 Nov, 2008
- Subject
- Computing and Processing
Boolean functions
Software testing
Heuristic algorithms
Computer science
Application software
Automatic testing
System testing
Software algorithms
Greedy algorithms
Linear programming
software testing
test suite reduction
representative set
Boolean function simplification
Quine-McCluskey algorithm
- Language
Test suite reduction is to find a subset of the test suite containing a minimal number of test cases that can satisfy all test requirements. Test suite reduction techniques attempt to remove redundant test cases. Existed minimal set selection methods cannot guarantee the optimality of representative sets obtained. This paper adapts the Quine-McCluskey algorithm to find the minimal representative set. To demonstrate the applicability of the approach, we conduct an experimental comparison. The results show that the Quine-McCluskey approach can identify the optimal test suite. Meanwhile, the application of this method for testing the automatic fare collection systems of Shanghai Metro also validated that it is effective.