{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T20:31:05Z","timestamp":1792787465462,"version":"4.5.0"},"reference-count":39,"publisher":"Association for Computing Machinery (ACM)","issue":"10","license":[{"start":{"date-parts":[[2026,9,17]],"date-time":"2026-09-17T00:00:00Z","timestamp":1789603200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/legalcode"}],"funder":[{"name":"Chongqing Municipal Science and Technology Bureau","award":["CSTB2025TIAD-STX0035"],"award-info":[{"award-number":["CSTB2025TIAD-STX0035"]}],"id":[{"id":"https:\/\/ror.org\/03ze5ke63","id-type":"ROR","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Softw. Eng. Methodol."],"published-print":{"date-parts":[[2026,10,31]]},"abstract":"<jats:p>In the realm of software fault localization, identifying the root causes of failed test cases is crucial for enhancing accuracy. Current methods aim to establish connections between test cases and source code components, relying on representation learning to model these relationships. However, this approach encounters challenges when considering the numerous test cases associated with a program, each exerting unique influences on code elements, thus varying the relationship\u2019s depth. To address this complexity, we construct a unified coverage graph based on code coverage data. Leveraging Graph Attention Networks (GAT), we capture intricate associations between program elements and diverse test cases. Furthermore, we devise a novel graph contrastive learning technique to facilitate the discovery of profound links between faulty code components and failed test cases. Our model\u2019s efficacy is substantiated through experiments on the widely used Defects4J (V-1.2.0) dataset in the software fault localization domain. Results reveal our model\u2019s superiority over baseline models in key metrics, including Top-1, Top-3, Top-5 rankings. Particularly noteworthy, our model identifies 41 more faults in the Top-1 category than state-of-the-art methods. Furthermore, when evaluated in cross-project scenarios, our model consistently outperforms other approaches, underscoring its robustness and optimality.<\/jats:p>","DOI":"10.1145\/3787964","type":"journal-article","created":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T14:03:55Z","timestamp":1772805835000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["CoverFL: Enhancing Fault Localization via Deep Coverage Relation"],"prefix":"10.1145","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6576-9641","authenticated-orcid":false,"given":"Wei","family":"Chen","sequence":"first","affiliation":[{"name":"Southwest University, Chongqing, China and Wuhan College of Communication, Wuhan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0824-0899","authenticated-orcid":false,"given":"Jiamou","family":"Liu","sequence":"additional","affiliation":[{"name":"The University of Auckland, Auckland, New Zealand"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0984-1629","authenticated-orcid":false,"given":"Kaiqi","family":"Zhao","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology Shenzhen, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3003-8902","authenticated-orcid":false,"given":"Mingyue","family":"Zhang","sequence":"additional","affiliation":[{"name":"Southwest University, Chongqing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5041-6122","authenticated-orcid":false,"given":"Wu","family":"Chen","sequence":"additional","affiliation":[{"name":"Southwest University, Chongqing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,9,17]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/PRDC.2006.18"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1002\/smr.2546"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM50108.2020.00031"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/2610384.2628055"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3660771"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/2931037.2931051"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/3293882.3330574"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/3133916"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE43902.2021.00067"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1002\/spe.3178"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3468264.3468580"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2014.28"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i5.25798"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.1509"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/2001420.2001445"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403168"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/3092703.3092717"},{"key":"e_1_3_1_19_2","unstructured":"Fan-Yun Sun Jordan Hoffmann Vikas Verma and Jian Tang. 2019. InfoGraph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization. arXiv:1908.01000. Retrieved from https:\/\/arxiv.org\/abs\/1908.01000"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-016-5226-y"},{"key":"e_1_3_1_21_2","unstructured":"Petar Veli\u010dkovi\u0107 William Fedus William L. Hamilton Pietro Li\u00f2 Yoshua Bengio and R. Devon Hjelm. 2018. Deep graph infomax. arXiv:1809.10341. Retrieved from https:\/\/arxiv.org\/abs\/1809.10341"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2019.2948158"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2011.2172031"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/SERE.2012.12"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/COMPSAC.2007.109"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICSME58846.2023.00033"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/2522920.2522924"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2012.08.008"},{"key":"e_1_3_1_29_2","first-page":"39","volume-title":"Essential Spectrum-Based Fault Localization","author":"Xie Xiaoyuan","year":"2020","unstructured":"Xiaoyuan Xie and Baowen Xu. 2020. On the maximality of spectrum-based fault localization. In Essential Spectrum-Based Fault Localization. Springer, 39\u201346."},{"key":"e_1_3_1_30_2","first-page":"83","volume-title":"Essential Spectrum-Based Fault Localization","author":"Xie Xiaoyuan","year":"2020","unstructured":"Xiaoyuan Xie and Baowen Xu. 2020. Spectrum-Based fault localization for multiple faults. In Essential Spectrum-Based Fault Localization. Springer, 83\u201391."},{"key":"e_1_3_1_31_2","first-page":"5812","volume-title":"Advances in Neural Information Processing Systems","volume":"33","author":"You Yuning","year":"2020","unstructured":"Yuning You, Tianlong Chen, Yongduo Sui, Ting Chen, Zhangyang Wang, and Yang Shen. 2020. Graph contrastive learning with augmentations. In Advances in Neural Information Processing Systems, Vol. 33, 5812\u20135823."},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.2011.6080769"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/CCDC.2016.7531562"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/SANER.2019.8668002"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2020.106486"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.2017EDL8143"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.4304\/jsw.6.10.1977-1984"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/1820454"},{"key":"e_1_3_1_39_2","unstructured":"Yanqiao Zhu Yichen Xu Feng Yu Qiang Liu Shu Wu and Liang Wang. 2020. Deep graph contrastive representation learning. arXiv:2006.04131. Retrieved from https:\/\/arxiv.org\/abs\/2006.04131"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2019.2892102"}],"container-title":["ACM Transactions on Software Engineering and Methodology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3787964","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,9,17]],"date-time":"2026-09-17T15:19:07Z","timestamp":1789658347000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3787964"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9,17]]},"references-count":39,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2026,10,31]]}},"alternative-id":["10.1145\/3787964"],"URL":"https:\/\/doi.org\/10.1145\/3787964","relation":{},"ISSN":["1049-331X","1557-7392"],"issn-type":[{"value":"1049-331X","type":"print"},{"value":"1557-7392","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,9,17]]},"assertion":[{"value":"2024-02-20","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-12-28","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-09-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}