A New Spectrum-based Fault Localization Method by Using Clustering Algorithm

Author(s):  
Hong Cai ◽  
Xing Xu
2014 ◽  
Vol 971-973 ◽  
pp. 1808-1811
Author(s):  
Kun Liang Zhang ◽  
Xiu Ying Peng ◽  
Hao Hua Li

Program slicing is a program analysis and understanding of technology. Sequence fault localization refers to the use of specific methods for faults in the program. Currently, the research program fault positioning is more and more people's attention and gets some results which is the more mainstream software fault localization method. Program slicing technique currently used to locate the fault procedures, which primarily to take advantage of dynamic slicing technique. Based on the full analysis of the advantages and disadvantages on the basis of previous work, we propose a flexible slicing rule and give a new method based on the slicing rule.


2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Hui He ◽  
Dongyan Zhang ◽  
Min Liu ◽  
Weizhe Zhang ◽  
Dongmin Gao

Software security defects have a serious impact on the software quality and reliability. It is a major hidden danger for the operation of a system that a software system has some security flaws. When the scale of the software increases, its vulnerability has becoming much more difficult to find out. Once these vulnerabilities are exploited, it may lead to great loss. In this situation, the concept of Software Assurance is carried out by some experts. And the automated fault localization technique is a part of the research of Software Assurance. Currently, automated fault localization method includes coverage based fault localization (CBFL) and program slicing. Both of the methods have their own location advantages and defects. In this paper, we have put forward a new method, named Reverse Data Dependence Analysis Model, which integrates the two methods by analyzing the program structure. On this basis, we finally proposed a new automated fault localization method. This method not only is automation lossless but also changes the basic location unit into single sentence, which makes the location effect more accurate. Through several experiments, we proved that our method is more effective. Furthermore, we analyzed the effectiveness among these existing methods and different faults.


1992 ◽  
Vol 31 (Part 1, No. 12B) ◽  
pp. 4525-4530 ◽  
Author(s):  
Kiyoshi Nikawa ◽  
Toyokazu Nakamura ◽  
Yasuko Hanagama ◽  
Tohru Tsujide ◽  
Kenji Morohashi ◽  
...  

2014 ◽  
Vol 24 (7) ◽  
pp. 1484-1494 ◽  
Author(s):  
Hui DING ◽  
Lin CHEN ◽  
Ju QIAN ◽  
Lei XU ◽  
Bao-Wen XU

Author(s):  
Zhang Hui

Among the fault localization methods of the coverage-based regression test cases, the ranking of suspiciousness degree is seriously impacted due to the existence of similar test cases, the existence of isolated treatment of each program entity and the coincidental correctness test cases as well as the poor quality of regression test cases, which reduces the efficiency of fault localization. This paper proposes a method that combines the control dependence and data dependence, test cases covering table and test result with vector angular cosine weight to solve the aforesaid problems. Experimental results show that the efficiency of the proposed fault localization of regression test cases is better than that of Tarantula, Jaccard, Ochiai, PPDG and CP methods.


Sign in / Sign up

Export Citation Format

Share Document