DocumentCode
2818495
Title
Compacting regression-suites on-the-fly
Author
Buchnik, Erez ; Ur, Shmuel
fYear
1997
fDate
2-5 Dec 1997
Firstpage
385
Lastpage
394
Abstract
Testing is one of the biggest problems of the software industry. Coverage is the main technique for showing that the testing has been thorough. Coverage can be used to find a good regression suite, i.e. a set of tests that is run on the application after sofware or data changes in order to check that no new bugs were introduced. This paper is about the experience gained in IBM Haifa Research Lab (HRL) in creating regression suites and minimizing their size, while maintaining high quality as measured in coverage. The problem we solve, while similar to the one addressed in the literature, has a key difference; the compaction algorithm is implemented online due to the large number of tests processed. We compare strategies for implementing online set-cover. The trade-offs are between the solution quality (as expressed by the size of the cover), the size of the intermediate sets and the computational resources. We show that it is possible to start discarding tests very early without getting a significantly larger final set
Keywords
computer aided software engineering; minimisation; online operation; program testing; statistical analysis; bugs; computational resources; coverage; intermediate set size; online set-cover; regression suite compaction algorithm; regression suite size minimization; software testing; solution quality; Application software; Computer bugs; Computer industry; Costs; Gain measurement; Hardware; Size measurement; Software debugging; Software testing; Test pattern generators;
fLanguage
English
Publisher
ieee
Conference_Titel
Software Engineering Conference, 1997. Asia Pacific ... and International Computer Science Conference 1997. APSEC '97 and ICSC '97. Proceedings
Print_ISBN
0-8186-8271-X
Type
conf
DOI
10.1109/APSEC.1997.640195
Filename
640195
Link To Document