2018 IEEE 42nd Annual Computer Software and Applications Conference (COMPSAC) 2018
DOI: 10.1109/compsac.2018.00039
|View full text |Cite
|
Sign up to set email alerts
|

Test Case Prioritization Based on Method Call Sequences

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 32 publications
0
3
0
Order By: Relevance
“…Fang et al [73] use logic coverage for TCP, where high coverage of logic expressions implies a high probability of detecting faults. Recently, Chi et al [19] demonstrate that basic structural coverage may not be enough to predict fault detection capability and propose a dynamic relation-based coverage based on method call sequences. Wang et al [28] detect fault-prone source code by existing code inspection techniques and then propose a quality-aware TCP technique (i.e., QTEP) by considering the weighted source code in terms of fault-proneness.…”
Section: Coverage Criteriamentioning
confidence: 99%
See 1 more Smart Citation
“…Fang et al [73] use logic coverage for TCP, where high coverage of logic expressions implies a high probability of detecting faults. Recently, Chi et al [19] demonstrate that basic structural coverage may not be enough to predict fault detection capability and propose a dynamic relation-based coverage based on method call sequences. Wang et al [28] detect fault-prone source code by existing code inspection techniques and then propose a quality-aware TCP technique (i.e., QTEP) by considering the weighted source code in terms of fault-proneness.…”
Section: Coverage Criteriamentioning
confidence: 99%
“…Given a coverage criterion (e.g., statement or method coverage), the total-greedy strategy selects the next test case yielding the highest coverage, whereas the additional-greedy strategy selects the next test case covering the maximum code units not covered in previous iterations. The recent empirical results show that although conceptually simple, the additional-greedy technique has been widely recognized as one of the most effective TCP techniques on average in terms of fault detection rate [16,17,18,19,20,21].…”
Section: Introductionmentioning
confidence: 99%
“…In addition to statement [1], branch [3], method [10,11], block [2] and modified condition/decision coverage [57], Elbaum et al [30] proposed a fault-exposing-potential (FEP) criterion based on the probability of the test case detecting a fault. Recently, Chi et al [58] used function call sequences, arguing that basic structural coverage may not be optimal for dynamic prioritization.…”
Section: Related Workmentioning
confidence: 99%