Towards More Precise Coincidental Correctness Detection With Deep Semantic Learning
Coincidental correctness (CC) is a situation during the execution of a test case, the buggy entity is executed, but the program behaves correctly as expected. Many automated fault localization (FL) techniques use runtime information to discover the underlying connection between the executed buggy entity and the failing test result. The existence of CC will weaken such connection, mislead the FL algorithms to build inaccurate models, and consequently, decrease the localization accuracy. To alleviate the adverse effect of CC on FL, CC detection techniques have been proposed to identify the possible CC tests via heuristic or machine learning algorithms. However, their performance on precision is not satisfactory since they overestimate the possible CC tests and are insufficient in learning the deep semantic features. In this work, we propose a novel <u>Tri</u>plet network-based <u>Co</u>incidental <u>Co</u>rrectness detection technique (<i>i.e.,</i> <b>TriCoCo</b>) to overcome the limitations of the prior works. <b>TriCoCo</b> narrows the possible CC tests by designing three features to identify genuine passing tests. Instead of using all tests as inputs by existing techniques, <b>TriCoCo</b> takes the identified genuine passing tests and failing ones to train a triplet model that can evaluate their relative distance. Finally, <b>TriCoCo</b> infers the probability of being a CC test of the test in the rest of the passing tests by using the trained triplet model. We conduct large-scale experiments to evaluate <b>TriCoCo</b> based on the widely-used Defects4J benchmark. The results demonstrate that <b>TriCoCo</b> can improve not only the precision of CC detection but also the effectiveness of FL techniques, <i>e.g.,</i> the precision of <b>TriCoCo</b> is 80.33<inline-formula><tex-math notation="LaTeX">$\%$</tex-math></inline-formula> on average, and <b>TriCoCo</b> boosts the efficacy of DStar by 18<inline-formula><tex-math notation="LaTeX">$\%$</tex-math></inline-formula>–74<inline-formula><tex-math notation="LaTeX">$\%$</tex-math></inline-formula> in terms of MFR metric when compared to seven state-of-the-art CC detection baselines.
Authors
- Lei Yan (ORCID: https://orcid.org/0000-0002-4779-2688)
- Huan Xie (ORCID: https://orcid.org/0000-0003-3272-7848)
- Meng Ling Yan (ORCID: https://orcid.org/0000-0002-9538-9121)
- Xiaoguang Mao (ORCID: https://orcid.org/0000-0003-4204-7424)
- David Lo (ORCID: https://orcid.org/0000-0002-4367-7201)
- Shanshan Li (ORCID: https://orcid.org/0009-0008-1613-2901)
- Yue Yu (ORCID: https://orcid.org/0000-0002-9865-2212)
Institutions
- Chongqing University (CN)
- National University of Defense Technology (CN)
- Singapore Management University (SG)
Publication Details
- Journal
- IEEE Transactions on Software Engineering
- Published
- 2024-10-16
- DOI
- https://doi.org/10.1109/tse.2024.3481893
- Citations
- 4
- Primary Topic
- Adversarial Robustness in Machine Learning
- Type
- article
- Field-Weighted Citation Impact
- 1.39