Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/5026
Title: MMFL: Multi-Modal Software Fault Localizer Using Structural Source Code Features
Authors: Barik, Paramananda
Kishore, Pushkar
Mohapatra, Durga Prasad
Nayak, Gayatri
Keywords: Fault localization
Debugging
Artificial neural networks
Branch coverage
Issue Date: Jan-2025
Citation: 2nd International Conference on Metaheuristics in Engineering and its Applications (METSOFT), SOA University, Bhubaneswar, 10-11 January 2025
Abstract: Software failures in applications result in significant costs for organizations, making it essential to identify and fix defects efficiently. Software fault localization, i.e., the process of pinpointing the location of bugs, helps developers re-duce debugging and maintenance efforts. Automated fault localization further accelerates bug finding and patching. Recent studies leverage artificial neural networks (ANNs) for fault localization, typically using binary branches and functions cov-erage data to train the models. However, the proposed approach enhances the performance of fault localizer by considering the number of times each branch and function are covered. The Siemens suite is employed for experiments and evaluations. A key finding of this research is that the equal (50%) split of training and testing data contributes to the higher model per-formance instead of 7:3 and 8:2 split. It is mainly due to presence of similar training samples in the training set leading to overfitting of the trained model. After testing, the proposed MMFL model successfully identifies all bugs in every program version, requiring just 16% of the code lines to be scanned, which is significantly less than the amount needed by current state-of-the-art methods.
Description: Copyright belongs to the proceeding publisher.
URI: http://hdl.handle.net/2080/5026
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
2025_METASOFT_PBarik_MMFL.pdf441.51 kBAdobe PDFView/Open    Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.