Fault localization is a necessary process of locating faults in buggy programs. This paper proposes a novel approach using dynamic slicing and association analysis to improve the effectiveness of fault localization. Our approach utilizes dynamic slicing to generate a reduced candidate set to narrow the range of faults, and introduces association analysis to mine the relationship between the statements in the execution traces and the test results. In addition, we develop a prototype tool DSFL to implement our approach. Furthermore, we perform a set of empirical studies with 12 Java programs to evaluate the effectiveness of the proposed approach. The experimental results show that our approach is more effective than the compared approaches.
Heling CAO
China University of Mining and Technology
Shujuan JIANG
China University of Mining and Technology
Xiaolin JU
China University of Mining and Technology,Nantong University
Yanmei ZHANG
China University of Mining and Technology
Guan YUAN
China University of Mining and Technology
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Heling CAO, Shujuan JIANG, Xiaolin JU, Yanmei ZHANG, Guan YUAN, "Applying Association Analysis to Dynamic Slicing Based Fault Localization" in IEICE TRANSACTIONS on Information,
vol. E97-D, no. 8, pp. 2057-2066, August 2014, doi: 10.1587/transinf.E97.D.2057.
Abstract: Fault localization is a necessary process of locating faults in buggy programs. This paper proposes a novel approach using dynamic slicing and association analysis to improve the effectiveness of fault localization. Our approach utilizes dynamic slicing to generate a reduced candidate set to narrow the range of faults, and introduces association analysis to mine the relationship between the statements in the execution traces and the test results. In addition, we develop a prototype tool DSFL to implement our approach. Furthermore, we perform a set of empirical studies with 12 Java programs to evaluate the effectiveness of the proposed approach. The experimental results show that our approach is more effective than the compared approaches.
URL: https://globals.ieice.org/en_transactions/information/10.1587/transinf.E97.D.2057/_p
Copy
@ARTICLE{e97-d_8_2057,
author={Heling CAO, Shujuan JIANG, Xiaolin JU, Yanmei ZHANG, Guan YUAN, },
journal={IEICE TRANSACTIONS on Information},
title={Applying Association Analysis to Dynamic Slicing Based Fault Localization},
year={2014},
volume={E97-D},
number={8},
pages={2057-2066},
abstract={Fault localization is a necessary process of locating faults in buggy programs. This paper proposes a novel approach using dynamic slicing and association analysis to improve the effectiveness of fault localization. Our approach utilizes dynamic slicing to generate a reduced candidate set to narrow the range of faults, and introduces association analysis to mine the relationship between the statements in the execution traces and the test results. In addition, we develop a prototype tool DSFL to implement our approach. Furthermore, we perform a set of empirical studies with 12 Java programs to evaluate the effectiveness of the proposed approach. The experimental results show that our approach is more effective than the compared approaches.},
keywords={},
doi={10.1587/transinf.E97.D.2057},
ISSN={1745-1361},
month={August},}
Copy
TY - JOUR
TI - Applying Association Analysis to Dynamic Slicing Based Fault Localization
T2 - IEICE TRANSACTIONS on Information
SP - 2057
EP - 2066
AU - Heling CAO
AU - Shujuan JIANG
AU - Xiaolin JU
AU - Yanmei ZHANG
AU - Guan YUAN
PY - 2014
DO - 10.1587/transinf.E97.D.2057
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E97-D
IS - 8
JA - IEICE TRANSACTIONS on Information
Y1 - August 2014
AB - Fault localization is a necessary process of locating faults in buggy programs. This paper proposes a novel approach using dynamic slicing and association analysis to improve the effectiveness of fault localization. Our approach utilizes dynamic slicing to generate a reduced candidate set to narrow the range of faults, and introduces association analysis to mine the relationship between the statements in the execution traces and the test results. In addition, we develop a prototype tool DSFL to implement our approach. Furthermore, we perform a set of empirical studies with 12 Java programs to evaluate the effectiveness of the proposed approach. The experimental results show that our approach is more effective than the compared approaches.
ER -