2019
DOI: 10.1109/access.2019.2922387
|View full text |Cite
|
Sign up to set email alerts
|

Prioritizing JUnit Test Cases Without Coverage Information: An Optimization Heuristics Based Approach

Abstract: Regression testing is an expensive activity and Test Case Prioritization (TCP) acts as an improvement mechanism for it. TCP techniques for object oriented programs need attention and in our study, we explored prioritization of JUnit test cases. Ten benchmark Java programs with their several mutated versions were studied. As collecting coverage information is a costly effort, we bypassed these steps and used optimization heuristics for ordering JUnit test cases at test method level. Our approach formulated a no… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
7
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(7 citation statements)
references
References 39 publications
0
7
0
Order By: Relevance
“…A supportive tool sOrTES is introduced to measure independence and ranking of integration test cases based on execution time and requirements coverage [11]. An approach for ordering JUnit test cases is proposed by using optimization heuristics including the Genetic Algorithm (GA), Simulated Annealing (SA), Ant Colony Optimization (ACO), and Multi-Objective Genetic Algorithm (MOGA) [12]. Ant Colony Optimization (ACO) based techniques are used to solve coverage-based TCP problems and are better than Genetic Algorithm based techniques [13].…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…A supportive tool sOrTES is introduced to measure independence and ranking of integration test cases based on execution time and requirements coverage [11]. An approach for ordering JUnit test cases is proposed by using optimization heuristics including the Genetic Algorithm (GA), Simulated Annealing (SA), Ant Colony Optimization (ACO), and Multi-Objective Genetic Algorithm (MOGA) [12]. Ant Colony Optimization (ACO) based techniques are used to solve coverage-based TCP problems and are better than Genetic Algorithm based techniques [13].…”
Section: Related Workmentioning
confidence: 99%
“…v value to fitmax1 and assign its permutation to parent A12 Assign the second-best APFD v value to fitmax2 and assign its permutation to parent B13 Update BestAPFD v and its permutation with fitmax1 and parent A 14Perform order crossover on permutation with BestAPFD…”
mentioning
confidence: 99%
“…Concentrating on the studies that suggest prioritizing test cases in a CI context based on testing characteristics [29][30][31] are very few, and pointing out their inconsistencies at this stage would be irrelevant. The distinction between this paper and previous work is that this study concentrated on the most extensive levels of testing, namely unit and integration, for TCP, which no previous study has done.…”
Section: Figurementioning
confidence: 99%
“…Several TCP techniques have been presented to enhance fault detection rates, with multi-coverage weighting techniques exhibiting promising performance. However, there has been relatively less focus on TCP techniques for OOP, particularly in Java [27] to [29].…”
Section: Related Workmentioning
confidence: 99%