{"title":"Improving the performance of software fault localization with effective coverage data reduction techniques","authors":"Chih-Chiang Fang , Chin-Yu Huang , Shou-Yu Lee , Yao-Hsien Tseng , C.W. Chu","doi":"10.1016/j.jss.2025.112388","DOIUrl":null,"url":null,"abstract":"<div><div>Fault localization (FL) techniques are widely used to identify the exact location of faulty statement in programs. Three common FL families are SBFL, MBFL, and deep learning-based FL, respectively. Before running any FL methods, coverage data is usually considered as input of FL stage. Therefore, coverage data plays an important role in FL field. On the other hand, if coverage data can be reduced effectively, the performance of FL will be greatly improved. In past studies, filtering out fault-irrelevant statements based on solely failed test cases, the traditional principal component analysis (PCA), and revised PCA techniques were applied to minimize coverage data. However, these approaches have a great opportunity to remove the actual faulty statement, especially in multiple fault localization (MFL). Tracing their root causes does not reflect the actual status of each statement. In this paper, we propose two approaches to improve the situations of deleted faulty statements. For the first approach, called Revised PCA with Ensemble Weight Integration (RPCA-EWI), it updates the contribution value of each statement based on revised PCA and incorporate the results of different combinations of failed and passed test cases. For the second approach, called Revised PCA with Important List Checking (RPCA-ILC), we establish a list of the top N% important statements by using the results of different test case combinations. If the deleted statement appears within this list, preserve it in reduced coverage data. Otherwise, it discards directly. We selected three Linux open-source codes (Gzip, Grep, and Sed) with 4 fault injections to validate the correctness. From the analysis of various perspectives, experimental results show that there is a significant improvement in shortening execution time of the FL process, and also can alleviate the situations for removed faulty statements compared to PCA and the revised PCA methods.</div></div>","PeriodicalId":51099,"journal":{"name":"Journal of Systems and Software","volume":"226 ","pages":"Article 112388"},"PeriodicalIF":3.7000,"publicationDate":"2025-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Systems and Software","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0164121225000561","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0
Abstract
Fault localization (FL) techniques are widely used to identify the exact location of faulty statement in programs. Three common FL families are SBFL, MBFL, and deep learning-based FL, respectively. Before running any FL methods, coverage data is usually considered as input of FL stage. Therefore, coverage data plays an important role in FL field. On the other hand, if coverage data can be reduced effectively, the performance of FL will be greatly improved. In past studies, filtering out fault-irrelevant statements based on solely failed test cases, the traditional principal component analysis (PCA), and revised PCA techniques were applied to minimize coverage data. However, these approaches have a great opportunity to remove the actual faulty statement, especially in multiple fault localization (MFL). Tracing their root causes does not reflect the actual status of each statement. In this paper, we propose two approaches to improve the situations of deleted faulty statements. For the first approach, called Revised PCA with Ensemble Weight Integration (RPCA-EWI), it updates the contribution value of each statement based on revised PCA and incorporate the results of different combinations of failed and passed test cases. For the second approach, called Revised PCA with Important List Checking (RPCA-ILC), we establish a list of the top N% important statements by using the results of different test case combinations. If the deleted statement appears within this list, preserve it in reduced coverage data. Otherwise, it discards directly. We selected three Linux open-source codes (Gzip, Grep, and Sed) with 4 fault injections to validate the correctness. From the analysis of various perspectives, experimental results show that there is a significant improvement in shortening execution time of the FL process, and also can alleviate the situations for removed faulty statements compared to PCA and the revised PCA methods.
期刊介绍:
The Journal of Systems and Software publishes papers covering all aspects of software engineering and related hardware-software-systems issues. All articles should include a validation of the idea presented, e.g. through case studies, experiments, or systematic comparisons with other approaches already in practice. Topics of interest include, but are not limited to:
•Methods and tools for, and empirical studies on, software requirements, design, architecture, verification and validation, maintenance and evolution
•Agile, model-driven, service-oriented, open source and global software development
•Approaches for mobile, multiprocessing, real-time, distributed, cloud-based, dependable and virtualized systems
•Human factors and management concerns of software development
•Data management and big data issues of software systems
•Metrics and evaluation, data mining of software development resources
•Business and economic aspects of software development processes
The journal welcomes state-of-the-art surveys and reports of practical experience for all of these topics.