{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,21]],"date-time":"2026-11-21T19:41:46Z","timestamp":1795290106578,"version":"4.10.3"},"reference-count":66,"publisher":"Association for Computing Machinery (ACM)","issue":"FSE","license":[{"start":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T00:00:00Z","timestamp":1720742400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Softw. Eng."],"published-print":{"date-parts":[[2024,7,12]]},"abstract":"<jats:p>Impact analysis (IA) is a critical software maintenance task that identifies the effects of a given set of code changes on a larger software project with the intention of avoiding potential adverse effects. IA is a cognitively challenging task that involves reasoning about the abstract relationships between various code constructs. Given its difficulty, researchers have worked to automate IA with approaches that primarily use coupling metrics as a measure of the \u201cconnectedness\u201d of different parts of a software project. Many of these coupling metrics rely on static, dynamic, or evolutionary information and are based on heuristics that tend to be brittle, require expensive execution analysis, or large histories of co-changes to accurately estimate impact sets.<\/jats:p>\n                  <jats:p>\n                    In this paper, we introduce a novel IA approach, called\n                    <jats:sc>Athena<\/jats:sc>\n                    , that combines a software system\u2019s dependence graph information with a conceptual coupling approach that uses advances in deep representation learning for code without the need for change histories and execution information. Previous IA benchmarks are small, containing less than ten software projects, and suffer from tangled commits, making it difficult to measure accurate results. Therefore, we constructed a large-scale IA benchmark, from 25 open-source software projects, that utilizes fine-grained commit information from bug fixes. On this new benchmark, our best performing approach configuration achieves an mRR, mAP, and HIT@10 score of 60.32%, 35.19%, and 81.48%, respectively. Through various ablations and qualitative analyses, we show that\n                    <jats:sc>Athena<\/jats:sc>\n                    \u2019s novel combination of program dependence graphs and conceptual coupling information leads it to outperform a simpler baseline by 10.34%, 9.55%, and 11.68% with statistical significance.\n                  <\/jats:p>","DOI":"10.1145\/3643770","type":"journal-article","created":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T10:22:09Z","timestamp":1720779729000},"page":"972-995","source":"Crossref","is-referenced-by-count":12,"title":["Enhancing Code Understanding for Impact Analysis by Combining Transformers and Program Dependence Graphs"],"prefix":"10.1145","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-2475-6802","authenticated-orcid":false,"given":"Yanfu","family":"Yan","sequence":"first","affiliation":[{"name":"William &amp; Mary, Williamsburg, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2498-705X","authenticated-orcid":false,"given":"Nathan","family":"Cooper","sequence":"additional","affiliation":[{"name":"William &amp; Mary, Williamsburg, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9683-5616","authenticated-orcid":false,"given":"Kevin","family":"Moran","sequence":"additional","affiliation":[{"name":"University of Central Florida, Orlando, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2216-3148","authenticated-orcid":false,"given":"Gabriele","family":"Bavota","sequence":"additional","affiliation":[{"name":"USI Lugano, Lugano, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5626-7586","authenticated-orcid":false,"given":"Denys","family":"Poshyvanyk","sequence":"additional","affiliation":[{"name":"William &amp; Mary, Williamsburg, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-9311-9919","authenticated-orcid":false,"given":"Steve","family":"Rich","sequence":"additional","affiliation":[{"name":"Cisco Systems, Maryville, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,7,12]]},"reference":[{"key":"e_1_3_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1985793.1985898"},{"key":"e_1_3_1_3_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.naacl-main.211"},{"key":"e_1_3_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/525066"},{"key":"e_1_3_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/APSEC.2005.100"},{"key":"e_1_3_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2016.2620458"},{"key":"e_1_3_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.2004.1357834"},{"key":"e_1_3_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.2006.33"},{"key":"e_1_3_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/3495724.3495883"},{"key":"e_1_3_1_10_1","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.7045041"},{"key":"e_1_3_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SANER48275.2020.9054806"},{"key":"e_1_3_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2642937.2642950"},{"key":"e_1_3_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2015.02.018"},{"key":"e_1_3_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2015.2481000"},{"key":"e_1_3_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2894751"},{"key":"e_1_3_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2970276.2970352"},{"key":"e_1_3_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.2010.5609732"},{"key":"e_1_3_1_18_1","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/W14-4012"},{"key":"e_1_3_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.2013.85"},{"key":"e_1_3_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2016.2553032"},{"key":"e_1_3_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/3157382.3157527"},{"key":"e_1_3_1_22_1","doi-asserted-by":"publisher","DOI":"10.18653\/V1\/N19-1423"},{"key":"e_1_3_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-011-9194-4"},{"key":"e_1_3_1_24_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.findings-emnlp.139"},{"key":"e_1_3_1_25_1","author":"Fink Stephen","year":"2012","unstructured":"Stephen Fink and Julian Dolby. 2012. WALA\u2013The TJ Watson Libraries for Analysis.","journal-title":"WALA\u2013The TJ Watson Libraries for Analysis"},{"key":"e_1_3_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2012.6227172"},{"key":"e_1_3_1_27_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.acl-long.499"},{"key":"e_1_3_1_28_1","article-title":"GraphCodeBERT: Pre-training Code Representations with Data Flow","author":"Guo Daya","year":"2020","unstructured":"Daya Guo, Shuo Ren, Shuai Lu, Zhangyin Feng, Duyu Tang, Shujie Liu, Long Zhou, Nan Duan, Alexey Svyatkovskiy, Shengyu Fu, Michele Tufano, Shao Kun Deng, Colin B. Clement, Dawn Drain, Neel Sundaresan, Jian Yin, Daxin Jiang, and Ming Zhou. 2020. GraphCodeBERT: Pre-training Code Representations with Data Flow. CoRR abs\/2009.08366 (2020). arXiv:2009.08366 https:\/\/arxiv.org\/abs\/2009.08366","journal-title":"CoRR abs\/2009.08366 (2020)"},{"key":"e_1_3_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3092703.3092719"},{"key":"e_1_3_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2010.04.005"},{"key":"e_1_3_1_31_1","article-title":"Large-Scale Manual Validation of Bug Fixing Commits: A Fine-grained Analysis of Tangling","author":"Herbold Steffen","year":"2020","unstructured":"Steffen Herbold, Alexander Trautsch, Benjamin Ledel, Alireza Aghamohammadi, Taher Ahmed Ghaleb, Kuljit Kaur Chahal, Tim Bossenmaier, Bhaveet Nagaria, Philip Makedonski, Matin Nili Ahmadabadi, Krist\u00f3f Szabados, Helge Spieker, Matej Madeja, Nathaniel Hoy, Valentina Lenarduzzi, Shangwen Wang, Gema Rodr\u00edguez-P\u00e9rez, Ricardo Colomo Palacios, Roberto Verdecchia, Paramvir Singh, Yihao Qin, Debasish Chakroborti, Willard Davis, Vijay Walunj, Hongjun Wu, Diego Marcilio, Omar Alam, Abdullah Aldaeej, Idan Amit, Burak Turhan, Simon Eismann, Anna-Katharina Wickert, Ivano Malavolta, Mat\u00fas Sul\u00edr, Fatemeh H. Fard, Austin Z. Henley, Stratos Kourtzanidis, Eray Tuzun, Christoph Treude, Simin Maleki Shamasbi, Ivan Pashchenko, Marvin Wyrich, James Davis, Alexander Serebrenik, Ella Albrecht, Ethem Utku Aktas, Daniel Str\u00fcber, and Johannes Erbel. 2020. Large-Scale Manual Validation of Bug Fixing Commits: A Fine-grained Analysis of Tangling. CoRR abs\/2011.06244 (2020). arXiv:2011.06244 https:\/\/arxiv.org\/abs\/2011.06244","journal-title":"CoRR abs\/2011.06244 (2020). arXiv:2011.06244"},{"key":"e_1_3_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-015-9376-6"},{"key":"e_1_3_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSR.2013.6624018"},{"key":"e_1_3_1_34_1","article-title":"CodeSearchNet Challenge: Evaluating the State of Semantic Code Search","author":"Husain Hamel","year":"2019","unstructured":"Hamel Husain, Ho-Hsiang Wu, Tiferet Gazit, Miltiadis Allamanis, and Marc Brockschmidt. 2019. CodeSearchNet Challenge: Evaluating the State of Semantic Code Search. CoRR abs\/1909.09436 (2019). arXiv:1909.09436 http:\/\/arxiv.org\/abs\/1909.09436","journal-title":"CoRR abs\/1909.09436 (2019). arXiv:1909.09436"},{"key":"e_1_3_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1512475.1512493"},{"key":"e_1_3_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2019.110441"},{"key":"e_1_3_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-012-9233-9"},{"key":"e_1_3_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/WCRE.2010.21"},{"key":"e_1_3_1_39_1","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1181"},{"key":"e_1_3_1_40_1","volume-title":"3rd International Conference on Learning Representations, ICLR 2015, San Diego, CA, USA, May 7-9, 2015, Conference Track Proceedings","author":"Kingma Diederik P.","year":"2015","unstructured":"Diederik P. Kingma and Jimmy Ba. 2015. Adam: A Method for Stochastic Optimization. In 3rd International Conference on Learning Representations, ICLR 2015, San Diego, CA, USA, May 7-9, 2015, Conference Track Proceedings, Yoshua Bengio and Yann LeCun (Eds.). http:\/\/arxiv.org\/abs\/1412.6980"},{"key":"e_1_3_1_41_1","article-title":"Semi-Supervised Classification with Graph Convolutional Networks","author":"Kipf Thomas N.","year":"2017","unstructured":"Thomas N. Kipf and Max Welling. 2017. Semi-Supervised Classification with Graph Convolutional Networks. In 5th International Conference on Learning Representations, ICLR 2017, Toulon, France, April 24-26, 2017, Conference Track Proceedings. OpenReview.net. https:\/\/openreview.net\/forum?id=SJU4ayYgl","journal-title":"5th International Conference on Learning Representations, ICLR 2017, Toulon, France, April 24-26, 2017, Conference Track Proceedings"},{"key":"e_1_3_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2597008.2597798"},{"key":"e_1_3_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/APSEC.2016.028"},{"key":"e_1_3_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2642937.2642997"},{"key":"e_1_3_1_45_1","doi-asserted-by":"publisher","unstructured":"Hongyu Kuang Patrick M\u00e4der Hao Hu Achraf Ghabi Liguo Huang Lv Jian and Alexander Egyed. 2012. Do data dependencies in source code complement call dependencies for understanding requirements traceability? 181\u2013190. https:\/\/doi.org\/10.1109\/ICSM.2012.6405270 10.1109\/ICSM.2012.6405270","DOI":"10.1109\/ICSM.2012.6405270"},{"key":"e_1_3_1_46_1","article-title":"Distributed Representations of Sentences and Documents","author":"Le Quoc V.","year":"2014","unstructured":"Quoc V. Le and Tom\u00e1s Mikolov. 2014. Distributed Representations of Sentences and Documents. CoRR abs\/1405.4053 (2014). arXiv:1405.4053 http:\/\/arxiv.org\/abs\/1405.4053","journal-title":"CoRR abs\/1405.4053 (2014). arXiv:1405.4053"},{"key":"e_1_3_1_47_1","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.1475"},{"key":"e_1_3_1_48_1","unstructured":"Shuai Lu Daya Guo Shuo Ren Junjie Huang Alexey Svyatkovskiy Ambrosio Blanco Colin B. Clement Dawn Drain Daxin Jiang Duyu Tang Ge Li Lidong Zhou Linjun Shou Long Zhou Michele Tufano Ming Gong Ming Zhou Nan Duan Neel Sundaresan Shao Kun Deng Shengyu Fu and Shujie Liu. 2021. CodeXGLUE: A Machine Learning Benchmark Dataset for Code Understanding and Generation. CoRR abs\/2102.04664 (2021). arXiv:2102.04664 https:\/\/arxiv.org\/abs\/2102.04664"},{"key":"e_1_3_1_49_1","volume-title":"1st International Conference on Learning Representations, ICLR 2013, Scottsdale, Arizona, USA, May 2-4, 2013, Workshop Track Proceedings","author":"Mikolov Tom\u00e1s","year":"2013","unstructured":"Tom\u00e1s Mikolov, Kai Chen, Greg Corrado, and Jeffrey Dean. 2013. Efficient Estimation of Word Representations in Vector Space. In 1st International Conference on Learning Representations, ICLR 2013, Scottsdale, Arizona, USA, May 2-4, 2013, Workshop Track Proceedings, Yoshua Bengio and Yann LeCun (Eds.). http:\/\/arxiv.org\/abs\/1301.3781"},{"key":"e_1_3_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-020-09823-w"},{"key":"e_1_3_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISSRE.2013.6698913"},{"key":"e_1_3_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-008-9088-2"},{"key":"e_1_3_1_53_1","article-title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","author":"Raffel Colin","year":"2019","unstructured":"Colin Raffel, Noam Shazeer, Adam Roberts, Katherine Lee, Sharan Narang, Michael Matena, Yanqi Zhou, Wei Li, and Peter J. Liu. 2019. Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer. CoRR abs\/1910.10683 (2019). arXiv:1910.10683 http:\/\/arxiv.org\/abs\/1910.10683","journal-title":"CoRR abs\/1910.10683 (2019). arXiv:1910.10683"},{"key":"e_1_3_1_54_1","unstructured":"Sable Research Group. 2023. Soot: A Java Bytecode Optimization Framework. https:\/\/soot-oss.github.io\/soot\/."},{"key":"e_1_3_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2008.25"},{"key":"e_1_3_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2010.81"},{"key":"e_1_3_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSME.2014.77"},{"key":"e_1_3_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/2393596.2393656"},{"key":"e_1_3_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/1852786.1852847"},{"key":"e_1_3_1_60_1","volume-title":"Advances in Neural Information Processing Systems","author":"Vaswani Ashish","year":"2017","unstructured":"Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, \u0141 ukasz Kaiser, and Illia Polosukhin. 2017. Attention is All you Need. In Advances in Neural Information Processing Systems, I. Guyon, U. Von Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett (Eds.), Vol. 30. Curran Associates, Inc. https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2017\/file\/3f5ee243547dee91fbd053c1c4a845aa-Paper.pdf"},{"key":"e_1_3_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2019.00101"},{"key":"e_1_3_1_62_1","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/5913634"},{"key":"e_1_3_1_63_1","article-title":"CLSEBERT: Contrastive Learning for Syntax Enhanced Code Pre-Trained Model","author":"Wang Xin","year":"2021","unstructured":"Xin Wang, Yasheng Wang, Pingyi Zhou, Fei Mi, Meng Xiao, Yadao Wang, Li Li, Xiao Liu, Hao Wu, Jin Liu, and Xin Jiang. 2021b. CLSEBERT: Contrastive Learning for Syntax Enhanced Code Pre-Trained Model. CoRR abs\/2108.04556 (2021). arXiv:2108.04556 https:\/\/arxiv.org\/abs\/2108.04556","journal-title":"CoRR abs\/2108.04556 (2021). arXiv:2108.04556"},{"key":"e_1_3_1_64_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.emnlp-main.685"},{"key":"e_1_3_1_65_1","author":"Yan Yanfu","year":"2024","unstructured":"Yanfu Yan, Nathan Cooper, Kevin Moran, Gabriele Bavota, Deny Poshyvanyk, and Steve Rich. 2024. Athena\u2019s Online Appendix https:\/\/github.com\/yanyanfu\/Athena.","journal-title":"Athena\u2019s Online Appendix"},{"key":"e_1_3_1_66_1","volume-title":"XLNet: generalized autoregressive pretraining for language understanding","author":"Yang Zhilin","year":"2019","unstructured":"Zhilin Yang, Zihang Dai, Yiming Yang, Jaime Carbonell, Ruslan Salakhutdinov, and Quoc V. Le. 2019. XLNet: generalized autoregressive pretraining for language understanding. Curran Associates Inc., Red Hook, NY, USA."},{"key":"e_1_3_1_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2004.1317478"}],"container-title":["Proceedings of the ACM on Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3643770","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3643770","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3643770","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T08:00:04Z","timestamp":1770192004000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3643770"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,12]]},"references-count":66,"journal-issue":{"issue":"FSE","published-print":{"date-parts":[[2024,7,12]]}},"alternative-id":["10.1145\/3643770"],"URL":"https:\/\/doi.org\/10.1145\/3643770","relation":{},"ISSN":["2994-970X"],"issn-type":[{"value":"2994-970X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,12]]}}}