{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T21:00:29Z","timestamp":1768424429698,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,5,21]],"date-time":"2022-05-21T00:00:00Z","timestamp":1653091200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,5,21]]},"DOI":"10.1145\/3510454.3516842","type":"proceedings-article","created":{"date-parts":[[2022,10,19]],"date-time":"2022-10-19T16:16:28Z","timestamp":1666196188000},"page":"41-45","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["COSPEX"],"prefix":"10.1145","author":[{"given":"Nakshatra","family":"Gupta","sequence":"first","affiliation":[{"name":"Indian Institute of Technology Tirupati, India"}]},{"given":"Ashutosh","family":"Rajput","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Tirupati, India"}]},{"given":"Sridhar","family":"Chimalakonda","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Tirupati, India"}]}],"member":"320","published-online":{"date-parts":[[2022,10,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3106739"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2009.28"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196321.3196334"},{"key":"e_1_3_2_1_4_1","volume-title":"Improved code summarization via a graph neural network. arXiv preprint arXiv:2004.02843","author":"LeClair Alexander","year":"2020","unstructured":"Alexander LeClair , Sakib Haque , Linfgei Wu , and Collin McMillan . 2020. Improved code summarization via a graph neural network. arXiv preprint arXiv:2004.02843 ( 2020 ). Alexander LeClair, Sakib Haque, Linfgei Wu, and Collin McMillan. 2020. Improved code summarization via a graph neural network. arXiv preprint arXiv:2004.02843 (2020)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2019.00087"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3430665.3456322"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2597008.2597149"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2011.42"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPC.2017.9"},{"key":"e_1_3_2_1_10_1","volume-title":"Neural Code Summarization: How Far Are We? arXiv preprint arXiv:2107.07112","author":"Shi Ensheng","year":"2021","unstructured":"Ensheng Shi , Yanlin Wang , Lun Du , Junjie Chen , Shi Han , Hongyu Zhang , Dongmei Zhang , and Hongbin Sun . 2021. Neural Code Summarization: How Far Are We? arXiv preprint arXiv:2107.07112 ( 2021 ). Ensheng Shi, Yanlin Wang, Lun Du, Junjie Chen, Shi Han, Hongyu Zhang, Dongmei Zhang, and Hongbin Sun. 2021. Neural Code Summarization: How Far Are We? arXiv preprint arXiv:2107.07112 (2021)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/6592.6594"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1858996.1859006"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSME.2018.00093"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cl.2016.07.003"},{"key":"e_1_3_2_1_15_1","volume-title":"6th Symposium on Languages, Applications and Technologies (SLATE","author":"Sul\u00edr Mat\u00fa\u0161","year":"2017","unstructured":"Mat\u00fa\u0161 Sul\u00edr and Jaroslav Porub\u00e4n . 2017 . Generating method documentation using concrete values from executions . In 6th Symposium on Languages, Applications and Technologies (SLATE 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. Mat\u00fa\u0161 Sul\u00edr and Jaroslav Porub\u00e4n. 2017. Generating method documentation using concrete values from executions. In 6th Symposium on Languages, Applications and Technologies (SLATE 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.15439\/2017F229"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3408877.3432423"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3238147.3238206"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3287324.3287385"}],"event":{"name":"ICSE '22: 44th International Conference on Software Engineering","location":"Pittsburgh Pennsylvania","acronym":"ICSE '22","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering","IEEE CS"]},"container-title":["Proceedings of the ACM\/IEEE 44th International Conference on Software Engineering: Companion Proceedings"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3510454.3516842","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3510454.3516842","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:15Z","timestamp":1750188615000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3510454.3516842"}},"subtitle":["a program comprehension tool for novice programmers"],"short-title":[],"issued":{"date-parts":[[2022,5,21]]},"references-count":19,"alternative-id":["10.1145\/3510454.3516842","10.1145\/3510454"],"URL":"https:\/\/doi.org\/10.1145\/3510454.3516842","relation":{},"subject":[],"published":{"date-parts":[[2022,5,21]]},"assertion":[{"value":"2022-10-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}