Proceedings of the 1st ACM International Workshop on Empirical Assessment of Software Engineering Languages and Technologies: H 2007
DOI: 10.1145/1353673.1353676
|View full text |Cite
|
Sign up to set email alerts
|

Efficient time-aware prioritization with knapsack solvers

Abstract: Regression testing is frequently performed in a time constrained environment. This paper explains how 0/1 knapsack solvers (e.g., greedy, dynamic programming, and the core algorithm) can identify a test suite reordering that rapidly covers the test requirements and always terminates within a specified testing time limit. We conducted experiments that reveal fundamental trade-offs in the (i) time and space costs that are associated with creating a reordered test suite and (ii) quality of the resulting prioritiz… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
24
0
2

Year Published

2010
2010
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 32 publications
(27 citation statements)
references
References 11 publications
1
24
0
2
Order By: Relevance
“…Some research effort has been spent to deal with the test execution time, adopting for example a genetic algorithm to reorder test suites in light of testing time constraints (under the assumption that all the tests have the same execution time) (Walcott et al 2006). Other approaches are integer linear programming (Zhang et al 2009) and knapsack solvers (Alspaugh et al 2007). The effect of constraints (on time to setup testing, time to identify and repair obsolete tests, and human time to inspect results) on test prioritization has been analyzed in Do et al (2010) and Do and Rothermel (2006).…”
Section: Previous Workmentioning
confidence: 99%
“…Some research effort has been spent to deal with the test execution time, adopting for example a genetic algorithm to reorder test suites in light of testing time constraints (under the assumption that all the tests have the same execution time) (Walcott et al 2006). Other approaches are integer linear programming (Zhang et al 2009) and knapsack solvers (Alspaugh et al 2007). The effect of constraints (on time to setup testing, time to identify and repair obsolete tests, and human time to inspect results) on test prioritization has been analyzed in Do et al (2010) and Do and Rothermel (2006).…”
Section: Previous Workmentioning
confidence: 99%
“…We obtained code change information using sandmark [7] as a byte code differencing tool, and we obtained software quality metrics (including data on coupling, cohesion, and complexity) from the Chidamber-Kemerer metrics suite [6] using the ckjm program. 1 Using this information and the original test suite, prioritization techniques produce reordered test suites for each version of P .…”
Section: Relative Cost-benefitmentioning
confidence: 99%
“…Because our focus is regression testing and detection of regression faults, in applying the model we considered only files that have been changed from the previous version. Using the LOC model, we obtained various ranges of numbers of faults across the different versions of our object programs; these ranges were: ant (3-39), jmeter (12)(13)(14)(15)(16)(17)(18)(19)(20)(21)(22)(23)(24)(25)(26), xml-security (5-10), nanoxml (1)(2)(3)(4)(5), and galileo (1)(2)(3)(4)(5)(6)(7)(8). Based on these numbers, for each version of each program we randomly selected several mutant groups of sizes falling within those ranges from the set of that version's mutation faults.…”
Section: Experiments Setupmentioning
confidence: 99%
See 1 more Smart Citation
“…An evaluation and discussion of the tradeoffs between time-aware test case selection quality and the efficiency of selecting using 0/1 Knapsack approximation algorithms [9,116].…”
Section: Contributions Of the Dissertationmentioning
confidence: 99%