Identifying Bug Signatures Using Discriminative Graph Mining

• Main Authors: CHENG, Hong, LO, David, ZHOU, YANG, WANG, Xiaoyin, YAN, Xifeng
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2009
• Subjects: bug signature; discriminative subgraph mining; Software Engineering
• Online Access: https://ink.library.smu.edu.sg/sis_research/282; https://ink.library.smu.edu.sg/context/sis_research/article/1281/viewcontent/issta09.pdf
• Institution: Singapore Management University

Bug localization has attracted a lot of attention recently. Most existing methods focus on pinpointing a single statement or function call which is very likely to contain bugs. Although such methods could be very accurate, it is usually very hard for developers to understand the context of the bug, given each bug location in isolation. In this study, we propose to model software executions with graphs at two levels of granularity: methods and basic blocks. An individual node represents a method or basic block and an edge represents a method call, method return or transition (at the method or basic block granularity). Given a set of graphs of correct and faulty executions, we propose to extract the most discriminative subgraphs which contrast the program flow of correct and faulty executions. The extracted subgraphs not only pinpoint the bug, but also provide an informative context for understanding and fixing the bug. Different from traditional graph mining which mines a very large set of frequent subgraphs, we formulate subgraph mining as an optimization problem and directly generate the most discriminative subgraph with a recently proposed graph mining algorithm LEAP. We further extend it to generate a ranked list of top-k discriminative subgraphs representing distinct locations which may contain bugs. Experimental results and case studies show that our proposed method is both effective and efficient to mine discriminative subgraphs for bug localization and context identification.