On the Effectiveness of the Tarantula Fault Localization Technique for Different Fault Classes

2011 ◽  
Author(s):  
Aritra Bandyopadhyay ◽  
Sudipto Ghosh
Keyword(s):  
Fault Localization ◽  
Localization Technique

MuSim: Mutation-based Fault Localization Using Test Case Proximity

2021 ◽  
Vol 31 (05) ◽  
pp. 725-744
Author(s):  
Arpita Dutta ◽  
Amit Jha ◽  
Rajib Mall
Keyword(s):  
Fault Localization ◽  
Test Case ◽  
Test Cases ◽  
Similarity Metrics ◽  
Localization Technique ◽  
Evaluation Metric

Fault localization techniques aim to localize faulty statements using the information gathered from both passed and failed test cases. We present a mutation-based fault localization technique called MuSim. MuSim identifies the faulty statement based on its computed proximity to different mutants. We study the performance of MuSim by using four different similarity metrics. To satisfactorily measure the effectiveness of our proposed approach, we present a new evaluation metric called Mut_Score. Based on this metric, on an average, MuSim is 33.21% more effective than existing fault localization techniques such as DStar, Tarantula, Crosstab, Ochiai.

Fault Detection Technique Based on Fine Grained Slicing Spectrum

2014 ◽  
Vol 543-547 ◽  
pp. 963-966
Author(s):  
Xi Guo
Keyword(s):  
Fault Detection ◽  
Fault Localization ◽  
Experimental Results ◽  
Detection Technique ◽  
Test Coverage ◽  
Localization Technique ◽  
Fine Grained ◽  
Software Errors ◽  
Check Points ◽  
Target Program

Test coverage information is usually used to compute the suspiciousness to locate the software errors in the current fault localization techniques, but this technique usually do not consider the reliance information within the target program, and the precision is also very low. A novel fault localization technique based on fine grained slicing spectrum is proposed in this paper, which can increase the efficiency of fault localization. This technique analyzes the reliance information under fine grained level, and selects the check points which are prone to be faulty, and the faulty statements is located according to the suspicious result. Experimental results show that this technique has better efficiency than the current techniques.

A Software Fault Localization Technique Based on Program Mutations

2014 ◽  
Vol 36 (11) ◽  
pp. 2236-2244
Author(s):  
Tao HE ◽  
Xin-Ming WANG ◽  
Xiao-Cong ZHOU ◽  
Wen-Jun LI ◽  
Zhen-Yu ZHANG ◽  
...  
Keyword(s):  
Fault Localization ◽  
Localization Technique ◽  
Software Fault

TIES WITHIN FAULT LOCALIZATION RANKINGS: EXPOSING AND ADDRESSING THE PROBLEM

2011 ◽  
Vol 21 (06) ◽  
pp. 803-827 ◽  
Author(s):  
XIAOFENG XU ◽  
VIDROHA DEBROY ◽  
W. ERIC WONG ◽  
DONGHUI GUO
Keyword(s):  
Fault Localization ◽  
Localization Technique ◽  
Number Of Components ◽  
Multiple Components ◽  
Study Results ◽  
Software Fault ◽  
Program Components

Software fault localization techniques typically rank program components, such as statements or predicates, in descending order of their suspiciousness (likelihood of being faulty). During debugging, programmers may examine these components, starting from the top of the ranking, in order to locate faults. However, the assigned suspiciousness to each component may not always be unique, and thus some of them may be tied for the same position in the ranking. In such a scenario, the total number of components that a programmer needs to examine in order to find the faults may vary considerably. The greater the variability, the harder it is for a programmer to decide which component to examine first, and the harder it is to accurately compute the expected effectiveness of a fault localization technique. In this paper, we first conduct a case study, based on three fault localization techniques across four sets of programs, which reveals that the phenomenon of assigning the same suspiciousness to multiple components is not limited to any technique or program in particular. Thus, to reduce variability and alleviate this problem, four tie-breaking strategies are discussed and evaluated empirically in our second case study. Results indicate that the strategies can not only reduce the number of ties in the rankings, but also maintain the effectiveness of the fault localization techniques. We also propose a new metric for evaluating fault localization techniques called CScore, which takes the notion of ties into account. Finally, an additional slicing-based approach to breaking ties is discussed briefly, which aims to provide further insights into tie-breaking and stimulate further research in the area.

Sign in / Sign up

Export Citation Format

Share Document