loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
18th IEEE International Conference on Automated Software Engineering (ASE'03)
Fault Localization With Nearest Neighbor Queries
Montreal, Quebec, Canada
October 06-October 10
ISBN: 0-7695-2035-9
Manos Renieris, Brown University
Steven P. Reiss, Brown University
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 programinput 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.
Citation:
Manos Renieris, Steven P. Reiss, "Fault Localization With Nearest Neighbor Queries," ase, pp.30, 18th IEEE International Conference on Automated Software Engineering (ASE'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.