Fault localization with nearest neighbor queries

被引:359
作者
Renieris, M [1 ]
Reiss, SP [1 ]
机构
[1] Brown Univ, Dept Comp Sci, Providence, RI 02912 USA
来源
18TH IEEE INTERNATIONAL CONFERENCE ON AUTOMATED SOFTWARE ENGINEERING, PROCEEDINGS | 2003年
关键词
D O I
10.1109/ASE.2003.1240292
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We present a method for performing fault localization using similar program spectra. Our method assumes the existence of a faulty run and a larger number of correct runs. It then selects according to a distance criterion the correct run that most resembles the faulty run, compares the spectra corresponding to these two runs, and produces a report of "suspicious" parts of the program. Our method is widely applicable because it does not require any knowledge of the program input and no more information from the user than a classification of the runs as either "correct" or "faulty". To experimentally validate the viability of the method, we implemented it in a tool, WHITHER using basic block profiling spectra. We experimented with two different similarity measures and the Siemens suite of 132 programs with injected bugs. To measure the success of the tool, we developed a generic method for establishing the quality of a report. The method is based on the way an "ideal user" would navigate the program using the report to save effort during debugging. The best results we obtained were, on average, above 50%, meaning that our ideal user would avoid looking at half of the program.
引用
收藏
页码:30 / 39
页数:10
相关论文
共 30 条
[11]  
GROCE A, 2003, LECT NOTES COMPUTER, V2648
[12]  
Hangal S, 2002, ICSE 2002: PROCEEDINGS OF THE 24TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, P291, DOI 10.1109/ICSE.2002.1007976
[13]   SPADES - a process algebra for discrete event simulation [J].
Harrison, PG ;
Strulo, B .
JOURNAL OF LOGIC AND COMPUTATION, 2000, 10 (01) :3-42
[14]  
Horwitz S., 1992, International Conference on Software Engineering, P392, DOI 10.1145/143062.143156
[15]  
HORWITZ S, 2002, P EUR S PROGR APR
[16]  
HORWITZ S, 1990, P ACM SIGPLAN C PROG, P234
[17]   FAST ALGORITHM FOR COMPUTING LONGEST COMMON SUBSEQUENCES [J].
HUNT, JW ;
SZYMANSKI, TG .
COMMUNICATIONS OF THE ACM, 1977, 20 (05) :350-353
[18]  
HUTCHINS M, 1994, PROC INT CONF SOFTW, P191, DOI 10.1109/ICSE.1994.296778
[19]   AUTOMATED SOFTWARE TEST DATA GENERATION [J].
KOREL, B .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1990, 16 (08) :870-879
[20]  
Leroy Xavier., 2007, OBJECTIVE CAML SYSTE