DocumentCode
1842126
Title
A New Method for Test Suite Reduction
Author
Zhang, Rui ; Jiang, Jianhui ; Yin, Jie ; Jin, Ang ; Lou, Jungang ; Wu, Ying
Author_Institution
Dept. of Comput. Sci. & Technol., Tongji Univ., Shanghai
fYear
2008
fDate
18-21 Nov. 2008
Firstpage
1211
Lastpage
1216
Abstract
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.
Keywords
program testing; Quine-McCluskey algorithm; Shanghai Metro; automatic fare collection systems; test cases; test suite reduction techniques; Application software; Automatic testing; Boolean functions; Computer science; Greedy algorithms; Heuristic algorithms; Linear programming; Software algorithms; Software testing; System testing; Boolean function simplification; Quine-McCluskey algorithm; representative set; software testing; test suite reduction;
fLanguage
English
Publisher
ieee
Conference_Titel
Young Computer Scientists, 2008. ICYCS 2008. The 9th International Conference for
Conference_Location
Hunan
Print_ISBN
978-0-7695-3398-8
Electronic_ISBN
978-0-7695-3398-8
Type
conf
DOI
10.1109/ICYCS.2008.501
Filename
4709146
Link To Document