Graph-Based Fault Localization

Abstract

The subject of fault localization (FL) is a much-researched area, it has large literature. There are plenty of algorithms that try to identify the location of the bugs using different approaches. Debugging has a large resource requirement, therefore the bug’s location’s reflective identifiicaton greatly helps developers and testers to maintain the quality and reliability of the software. Our goal is to implement a graph-based Fl GFL approach that effectively finds the location of the bugs in the source code. In our research we performed an empirical evaluation using the Defects4J and the results were compared with six other algorithms accepted by the literature. The results show that our method finds the errors more effectively than the other presented procedures, thus speeding up the bug fixes.