An Improvement to Fault Localization Technique Based on Branch-Coverage Spectra

• Published in: 2015 IEEE 39th Annual Computer Software and Applications Conference Vol. 2; pp. 282 - 287
• Main Authors: Xu, Sihan, Xu, Jing, Yang, Hongji, Yang, Jufeng, Guo, Chenkai, Yuan, Liying, Song, Wenli, Si, Guannan
• Format: Conference Proceeding Journal Article
• Language: English
• Published: IEEE 01.07.2015
• Subjects: Algorithms; Applications programs; Benchmark testing; branch coverage; Computer programs; Debugging; fault localization; Faults; Flexible printed circuits; Instruments; Localization; Measurement; Position (location); Probability; program spectra; Run time (computers); Software; trust
• ISSN: 0730-3157
• DOI: 10.1109/COMPSAC.2015.53

For trust in software, developers spend much effort debugging to ensure that software behaviors as expected. Spectrum-based fault localization techniques (SFL) make use of runtime coverage of program elements, like statements, branches and du-pairs, and then check codes in the order of the rank of suspiciousness. So, correct elements with higher suspiciousness than faulty elements cause the loss of precision. In this paper, we focus on a situation where suspiciousness calculated according to coverage and outcome, i.e. Successful or failing, is higher than it should be. It is found that when a branch structure is repeatedly executed, which is normal in real-life programs, and all of its branches are covered within a run, a branch related to faults could lead other branches to be doubted. To reduce effects between branches, we do the following things: First, we utilize branches to monitor program behaviors, second, we take test cases with high similarities as triggered by the same fault, third, for branches mentioned, we propose an algorithm to infer which branch is more likely to be faulty in the failure, finally, experiments based on Siemens benchmark set and flex show that our approach is useful to heighten the ranking of faulty elements by reducing suspiciousness of correct branches.