ICST 2020 (series) / NEXTA 2020 (series) / NEXTA 2020 /
Runtime Prioritization with the Classification Tree Method for Test Automation
Even for automated testing, it can be necessary to prioritize test cases. One way is to order test cases by their expected runtime. However, the manual prediction and assignment of expected runtimes to test cases requires in depth knowledge of the system under test and remains time consuming and error prone. We propose an approach for automated runtime prioritization with the classification tree method. The idea is to measure the runtime of a few chosen test cases to predict the runtimes for the other test cases. This allows for better usage of limit test execution times in highly automated testing environments. We identify several challenges and propose possible solutions.
Sat 24 OctDisplayed time zone: Lisbon change
Sat 24 Oct
Displayed time zone: Lisbon change
11:00 - 12:30 | |||
11:00 30mFull-paper | Optimization of automated executions based on integration test configurations of embedded software NEXTA 2020 Masashi Mizoguchi Hitachi Ltd., Takahiro Iida Hitachi Automotive Systems Ltd., Toru Irie Hitachi Automotive Systems Ltd. Link to publication DOI | ||
11:30 30mFull-paper | Selective Regression Testing based on Big Data: Comparing Feature Extraction Techniques NEXTA 2020 Khaled Al-Sabbagh University of Gothenburg, Miroslaw Staron University of Gothenburg, Regina Hebig Chalmers | Gothenburg University, Miroslaw Ochodek Poznan University of Technology, Wilhelm Meding Ericsson Link to publication DOI | ||
12:00 20mFull-paper | Runtime Prioritization with the Classification Tree Method for Test Automation NEXTA 2020 Link to publication DOI |