Mining Edge-Weighted Call Graphs to Localise Software Bugs
coauthor: Klemens Böhm, Institute for Program Structures and Data Organization (IPD), University of Karlsruhe
coauthor: Matthias Huber, Institute for Program Structures and Data Organization (IPD), University of Karlsruhe
published: Oct. 10, 2008, recorded: September 2008, views: 250
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
An important problem in software engineering is the automated discovery of noncrashing occasional bugs. In this work we address this problem and show that mining of weighted call graphs of program executions is a promising technique. We mine weighted graphs with a combination of structural and numerical techniques. More specifically, we propose a novel reduction technique for call graphs which introduces edge weights. Then we present an analysis technique for such weighted call graphs based on graph mining and on traditional feature selection schemes. The technique generalises previous graph mining approaches as it allows for an analysis of weights. Our evaluation shows that our approach finds bugs which previous approaches cannot detect so far. Our technique also doubles the precision of finding bugs which existing techniques can already localise in principle.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !