Xin Fan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Xin Fan has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Yun Ge
School of Software, Nanchang Hangkong University, Nanchang 330063, China
2 shared publications - Kaisheng Wu
School of Software, Nanchang Hangkong University, Nanchang 330063, China
1 shared publication - Li Yu
College of Aerospace Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China
1 shared publication - Shuqing Zhang
School of Software, Nanchang Hangkong University, Nanchang 330063, China
1 shared publication - Wei Zheng
School of Software, Nanchang Hangkong University, Nanchang 330063, China
1 shared publication - Zhenlei Fu
School of Software, Nanchang Hangkong University, Nanchang 330063, China
1 shared publication
Latest Publications
- Open Access
- 16 February 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (4) , 2079
Software Fault Localization Based on SALSA Algorithm
In software development, debugging is the most tedious and time-consuming phase. Therefore, various automated fault localization techniques have been proposed to assist debugging. Among existing fault localization techniques, Spectrum-Based Fault Localization (SBFL) is one of the most extensively researched methods. Traditional SBFL techniques rely solely on the coverage of program execution for fault localization, which means they neglect the interactions between program entities and fault propagation paths during the execution of the program, resulting in a tie problem that reduces the accuracy of fault localization. To solve the above problem, this paper proposes SA-SBFL, a fault localization method based on the SALSA (Random Method for Link Structure Analysis) algorithm. First, a link graph of program entities is constructed, which includes interactions between program entities and fault propagation paths. Then, the suspicion values obtained from traditional SBFL methods are used as the initial weights of the link graph. Finally, the random walk model is employed to simulate the propagation of faults among program entities, analyze the importance of program entities in the fault propagation process, and obtain a ranking list of suspicious program entities. The experiments in this paper demonstrate that the SA-SBFL method significantly outperforms general SBFL methods. For instance, in the Defects4J dataset, the SA-SBFL technique outperforms traditional SBFL in terms of fault localization accuracy, with a 47% improvement in the Top-1 metric and a 10% increase in the Top-5 metric, and it also showed an average improvement of 19% in the EXAM metric.
- 16 February 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (4) , 2079
Open AccessSoftware Fault Localization Based on SALSA Algorithm
In software development, debugging is the most tedious and time-consuming phase. Therefore, various automated fault localization techniques have been proposed to assist debugging. Among existing fault localization techniques, Spectrum-Based Fault Localization (SBFL) is one of the most extensively researched methods. Traditional SBFL techniques rely solely on the coverage of program execution for fault localization, which means they neglect the interactions between program entities and fault propagation paths during the execution of the program, resulting in a tie problem that reduces the accuracy of fault localization. To solve the above problem, this paper proposes SA-SBFL, a fault localization method based on the SALSA (Random Method for Link Structure Analysis) algorithm. First, a link graph of program entities is constructed, which includes interactions between program entities and fault propagation paths. Then, the suspicion values obtained from traditional SBFL methods are used as the initial weights of the link graph. Finally, the random walk model is employed to simulate the propagation of faults among program entities, analyze the importance of program entities in the fault propagation process, and obtain a ranking list of suspicious program entities. The experiments in this paper demonstrate that the SA-SBFL method significantly outperforms general SBFL methods. For instance, in the Defects4J dataset, the SA-SBFL technique outperforms traditional SBFL in terms of fault localization accuracy, with a 47% improvement in the Top-1 metric and a 10% increase in the Top-5 metric, and it also showed an average improvement of 19% in the EXAM metric.
- Open Access
- 15 November 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (22) , 12344
Fault Localization Using TrustRank Algorithm
Spectrum-based fault localization (SBFL), a widely recognized technique in automated fault localization, has limited effectiveness due to its disregard for the internal information of the program under test suites. To overcome this limitation, a novel TrustRank-based fault localization (TRFL) technique is introduced. TRFL enhances traditional SBFL by incorporating internal data dependencies of the program under the test suite, thereby providing a more comprehensive analysis. It constructs a node-weighted program execution network and employs the TrustRank algorithm to analyze network centrality and re-rank program entities based on their suspiciousness. Furthermore, a bidirectional TrustRank algorithm (Bi-TRFL) is extended that takes into account the influence relationship between network nodes for more accurate fault localization. When applied to large-scale datasets with real faults, such as Defects4J, TRFL, and Bi-TRFL, it significantly outperforms traditional SBFL methods in fault localization. They demonstrate up to 40% and 13% improvement in Top-1 and Top-5 rankings, respectively, proving their robustness and efficiency with minimal sensitivity to related parameters.
- 15 November 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (22) , 12344
Open AccessFault Localization Using TrustRank Algorithm
Spectrum-based fault localization (SBFL), a widely recognized technique in automated fault localization, has limited effectiveness due to its disregard for the internal information of the program under test suites. To overcome this limitation, a novel TrustRank-based fault localization (TRFL) technique is introduced. TRFL enhances traditional SBFL by incorporating internal data dependencies of the program under the test suite, thereby providing a more comprehensive analysis. It constructs a node-weighted program execution network and employs the TrustRank algorithm to analyze network centrality and re-rank program entities based on their suspiciousness. Furthermore, a bidirectional TrustRank algorithm (Bi-TRFL) is extended that takes into account the influence relationship between network nodes for more accurate fault localization. When applied to large-scale datasets with real faults, such as Defects4J, TRFL, and Bi-TRFL, it significantly outperforms traditional SBFL methods in fault localization. They demonstrate up to 40% and 13% improvement in Top-1 and Top-5 rankings, respectively, proving their robustness and efficiency with minimal sensitivity to related parameters.