2020
DOI: 10.1007/s11390-020-0549-4
|View full text |Cite
|
Sign up to set email alerts
|

FATOC: Bug Isolation Based Multi-Fault Localization by Using OPTICS Clustering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 17 publications
(6 citation statements)
references
References 47 publications
0
6
0
Order By: Relevance
“…In other words, each test cluster represents a different bug. Then, the failed test cases in each cluster combined with all passed test cases are used to localize only a single fault as in [63]- [65].…”
Section: G Single and Multiple Bugsmentioning
confidence: 99%
“…In other words, each test cluster represents a different bug. Then, the failed test cases in each cluster combined with all passed test cases are used to localize only a single fault as in [63]- [65].…”
Section: G Single and Multiple Bugsmentioning
confidence: 99%
“…Considering that the interactive behaviors among software entities implied some fault patterns, Zhao et al [18] introduced the fault influence of interactive entities and developed a novel synthetical fault localization approach based on the software network. Wu et al [19] adopted OPTICS clustering to group failed test cases, the failed test cases in this cluster, with all passed test cases to locate a single-bug.…”
Section: Spectrum-based Fault Localization (Sbfl)mentioning
confidence: 99%
“…Many researchers have attempted to employ the clustering technique to divide failed test cases [3,12,[25][26][27]. Ideally, failures caused by the same fault should be grouped into a cluster, then the failed test cases in a cluster are combined with all successful test cases to form a fault-focused TS targeting a specific fault, as defined in Formula 1 and Formula 2.…”
Section: Why Clustering?mentioning
confidence: 99%
“…Based on one-fault-ata-time via OPTICS (Ordering Points To Identify the Clustering Structure) clustering, Wu et al proposed to 1) divide failed test cases in each iteration and calculate the density of each cluster, 2) combine the failed test cases in the cluster with the highest density value with all successful test cases to form a new test suite, and 3) localize a single fault based on the ranking list produced by the new test suite, iterating these steps until all bugs are fixed. Based on their findings, they further concluded that using the clustering algorithm with the highest accuracy can achieve the best performance of multi-fault localization [25]. Inspired by the multiple-fault-at-a-time strategy, Zheng et al converted fault localization tasks into search problems and proposed a fast software multi-fault localization framework using genetic algorithms [71].…”
Section: Related Workmentioning
confidence: 99%