Improved Software Fault Detection with Graph Mining

author: Frank Eichinger, Institute for Program Structures and Data Organization (IPD), University of Karlsruhe
published: Aug. 25, 2008,   recorded: July 2008,   views: 4587


Related Open Educational Resources

Related content

Report a problem or upload files

If 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.
Lecture popularity: You need to login to cast your vote.


This work addresses the problem of discovering bugs in software development. We investigate the utilization of call graphs of program executions and graph mining algorithms to approach this problem. 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. Our new approach finds bugs which could not be detected so far. With regard to bugs which can already be localized, our technique also doubles the precision of finding them.

See Also:

Download slides icon Download slides: mlg08_eichinger_isfd_01.pdf (681.4┬áKB)

Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: