ACM Home Page
Please provide us with feedback. Feedback
Failure proximity: a fault localization-based approach
Full text PdfPdf (729 KB)
Source Foundations of Software Engineering archive
Proceedings of the 14th ACM SIGSOFT international symposium on Foundations of software engineering table of contents
Portland, Oregon, USA
SESSION: Mining failures and bugs table of contents
Pages: 46 - 56  
Year of Publication: 2006
ISBN:1-59593-468-5
Authors
Chao Liu  University of Illinois at Urbana-Champaign, Urbana, IL
Jiawei Han  University of Illinois at Urbana-Champaign, Urbana, IL
Sponsors
SIGSOFT: ACM Special Interest Group on Software Engineering
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 52,   Citation Count: 7
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1181775.1181782
What is a DOI?

ABSTRACT

Recent software systems usually feature an automated failure reporting system, with which a huge number of failing traces are collected every day. In order to prioritize fault diagnosis, failing traces due to the same fault are expected to be grouped together. Previous methods, by hypothesizing that similar failing traces imply the same fault, cluster failing traces based on the literal trace similarity, which we call trace proximity. However, since a fault can be triggered in many ways, failing traces due to the same fault can be quite different. Therefore, previous methods actually group together traces exhibiting similar behaviors, like similar branch coverage, rather than traces due to the same fault. In this paper, we propose a new type of failure proximity, called R-Proximity, which regards two failing traces as similar if they suggest roughly the same fault location. The fault location each failing case suggests is automatically obtained with Sober, an existing statistical debugging tool. We show that with R-Proximity, failing traces due to the same fault can be grouped together. In addition, we find that R-Proximity is helpful for statistical debugging: It can help developers interpret and utilize the statistical debugging result. We illustrate the usage of R-Proximity with a case study on the grep program and some experiments on the Siemens suite, and the result clearly demonstrates the advantage of R-Proximity over trace proximity.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
I. Borg and P. Groenen. Modern Multidimensional Scaling: Theory and Applications. Springer, first edition, 1996.
2
3
 
4
5
 
6
7
8
9
 
10
M. Kendall and J. D. Gibbons. Rank Correlation Methods. Edward Arnold, 1990.
11
12
13
 
14
J. I. Marden. Analyzing and Modeling Rank Data. Chapman & Hall/CRC, first edition, 1996.
15
 
16
 
17
M. Renieris and S. Reiss. Fault localization with nearest neighbor queries. In ASE'03.
18
19

CITED BY  7