Mining Edge-Weighted Call Graphs to Localise Software Bugs
An important problem in software engineering is the automated discovery of non-crashing occasional bugs. In this paper, the authors address this problem and show that mining of weighted call graphs of program executions is a promising technique. They mine weighted graphs with a combination of structural and numerical techniques. More specifically, they propose a novel reduction technique for call graphs which introduces edge weights. Then they 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.