(Semi-)automated bug localisation is an important issue in software engineering. Recent techniques based on call graphs and graph mining can locate bugs in relatively small programs, but do not scale for real-world applications. In this paper we describe a bug-localisation approach based on graph mining that has this property, at least according to preliminary experiments. Our main contribution is the definition and analysis of class-level call graphs, with encouraging results.
Towards Scalability of Graph-Mining Based Bug Localisation
Proceedings of the 7th International Workshop on Mining and Learning with Graphs (MLG), Leuven, Belgium, 2009