Indexing Noncrashing Failures: A Dynamic Program Slicing-Based Approach

Recent software systems usually feature an automated failure reporting component, with which a huge number of failures are collected from software end-users. With a proper support of failure indexing, which identifies failures due to the same fault, the collected failure data can help developers prioritize failure diagnosis, among other utilities of the failure data. Since crashing failures can be effectively indexed by program crashing venues, current practice has seen great success in prioritizing crashing failures. A recent study of bug characteristics indicates that as excellent memory checking tools are widely adopted, semantic bugs and the resulting noncrashing failures have become dominant. Unfortunately, the problem of how to index noncrashing failures has not been seriously studied before. In previous study, two techniques have been proposed to index noncrashing failures, and they are T-PROXIMITY and R-PROXIMITY. However, as T-PROXIMITY indexes failures by the profile of th...

• Type: Conference
• Year: 2007
• Where: ICSM
• Authors: Xiangyu Zhang Chao Liu, Yu Zhang, Jiawei Han, Bharat K. Bhargava
• Keywords: Failure Data, ICSM 2007, Index Noncrashing Failures, Noncrashing Failures, Software Engineering