The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2020 IEEE 9th Global Conference on Consumer Electronics (GCCE) 2020
DOI: 10.1109/gcce50665.2020.9291990
|View full text |Cite
|
Sign up to set email alerts
|

Code Coverage Similarity Measurement Using Machine Learning for Test Cases Minimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 11 publications
0
4
0
Order By: Relevance
“…In situations where there is limited historical data or when codebases evolve rapidly, the predictive accuracy of the model may be compromised. To overcome this limitation, continuous refinement of the model and exploration of more advanced machine learning techniques are necessary [6].…”
Section: Discussionmentioning
confidence: 99%
“…In situations where there is limited historical data or when codebases evolve rapidly, the predictive accuracy of the model may be compromised. To overcome this limitation, continuous refinement of the model and exploration of more advanced machine learning techniques are necessary [6].…”
Section: Discussionmentioning
confidence: 99%
“…Some of the techniques are not suitable for RT as they are not suitable for larger test suits [40]. The other reported issues are related to the path coverage as the presented techniques are not suitable in terms of path coverage [41]. Fulfilment of the requirements is an important issue that is not handled by the existing techniques and focus on code check only [42].…”
Section: Related Workmentioning
confidence: 99%
“…There were several articles made describing different kinds of approaches, such as selection-and priority-based, [4][5][6] solver-based, 7,8 evolutionary, 9,10 graph-based, 11,12 machine learning and data-mining ones, 3,13 and other search-based methods. 14 Not only individual approaches have been discussed in the literature, but efforts have been made to conduct meta-analyses and survey reviews.…”
Section: Approaches Heuristics Algorithmsmentioning
confidence: 99%
“…One optimal solution to this problem is to find a minimum‐sized test suite, achieved through test suite minimization (TSM) by reducing the base one through selectively removing redundant tests based on some priority system, known as test case selection (TCS) or test case prioritization while maintaining code coverage metrics 1 . However, this approach poses challenges as some algorithms may decrease coverage metrics in specific situations (e.g., clusterization 3 without additional management).…”
Section: Introductionmentioning
confidence: 99%