{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,3]],"date-time":"2026-08-03T19:56:20Z","timestamp":1785786980716,"version":"3.56.0"},"reference-count":73,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Science Foundation for Excellent Young Scholars of China","award":["62422604"],"award-info":[{"award-number":["62422604"]}]},{"name":"Sichuan Science and Technology Program","award":["2025NSFJQ005"],"award-info":[{"award-number":["2025NSFJQ005"]}]},{"DOI":"10.13039\/501100018542","name":"Natural Science Foundation of Sichuan Province","doi-asserted-by":"crossref","award":["2024NSFSC1070"],"award-info":[{"award-number":["2024NSFSC1070"]}],"id":[{"id":"10.13039\/501100018542","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Key Research and Development Program of China","award":["2024YFF0509600"],"award-info":[{"award-number":["2024YFF0509600"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1109\/tevc.2026.3655808","type":"journal-article","created":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T20:55:04Z","timestamp":1768856104000},"page":"1347-1361","source":"Crossref","is-referenced-by-count":0,"title":["Evolutionary Computation-Enhanced Large Language Models for Intelligent Code Completion"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2449-5138","authenticated-orcid":false,"given":"Dongbo","family":"Liu","sequence":"first","affiliation":[{"name":"Chengdu University of Information Technology","place":["Chengdu, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ziqi","family":"Tan","sequence":"additional","affiliation":[{"name":"Sichuan University","place":["Chengdu, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8851-5348","authenticated-orcid":false,"given":"Gary G.","family":"Yen","sequence":"additional","affiliation":[{"name":"Sichuan University","place":["Chengdu, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Suling","family":"Duan","sequence":"additional","affiliation":[{"name":"Chengdu University of Information Technology","place":["Chengdu, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8692-9635","authenticated-orcid":false,"given":"Yimin","family":"Zhou","sequence":"additional","affiliation":[{"name":"Chengdu University of Information Technology","place":["Chengdu, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6519-7332","authenticated-orcid":false,"given":"Zhenan","family":"He","sequence":"additional","affiliation":[{"name":"Sichuan University","place":["Chengdu, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1590\/S1413-70542011000600001"},{"issue":"3","key":"ref2","first-page":"1","article-title":"Integrating trust and computer self-efficacy with TAM: An empirical assessment of customers\u2019 acceptance of banking information systems (BIS) in Jamaica","volume":"12","author":"Reid","year":"2008","journal-title":"J. Internet Banking Commerce"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MS.2008.107"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2012.147"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/356725.356731"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CMPCON.1988.4868"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330699"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/VLHCC.2010.12"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1595696.1595728"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2744200"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/581339.581402"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1453101.1453129"},{"key":"ref13","first-page":"204","article-title":"Parseweb: A programmer assistant for reusing open source code on the Web","volume-title":"Proc. 22nd IEEE\/ACM Int. Conf. Automated Softw. Eng.","author":"Suresh"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.3837\/tiis.2019.04.002"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2019.105866"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99253-2_16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-016-9277-5"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754769"},{"key":"ref19","first-page":"3104","article-title":"Sequence to sequence learning with neural networks","author":"Sutskever","year":"2014","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3439726"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s12525-021-00475-2"},{"key":"ref22","first-page":"5947","article-title":"Exploring generalization in deep learning","volume-title":"Adv. Neural Inf. Proc. Syst.","volume":"30","author":"Neyshabur","year":"2017"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3212695"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2979670"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3106237.3106290"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.2015.7332513"},{"key":"ref27","article-title":"Learning Python code suggestion with a sparse pointer network","author":"Bhoopchand","year":"2016","journal-title":"arXiv:1611.08307"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/72.279181"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/423"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2019.00086"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P17-1041"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE43902.2021.00026"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10139"},{"key":"ref34","article-title":"Learning to represent programs with graphs","author":"Allamanis","year":"2017","journal-title":"arXiv:1711.00740"},{"key":"ref35","article-title":"Generative code modeling with graphs","author":"Brockschmidt","year":"2018","journal-title":"arXiv:1805.08490"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/SANER48275.2020.9054857"},{"key":"ref37","article-title":"GraphCodeBERT: Pre-training code representations with data flow","author":"Guo","year":"2020","journal-title":"arXiv:2009.08366"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3385999"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3236024.3236085"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3296979.3192412"},{"key":"ref41","article-title":"Evaluating large language models trained on code","author":"Chen","year":"2021","journal-title":"arXiv:2107.03374"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2009.2033566"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2022.3162324"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2006.890265"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/1321631.1321693"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/2739482.2768458"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-55696-3_17"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321865"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2022.3205286"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.csl.2014.09.005"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P16-1154"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P16-1057"},{"key":"ref53","first-page":"2091","article-title":"A convolutional attention network for extreme summarization of source code","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Allamanis"},{"key":"ref54","article-title":"Code2seq: Generating sequences from structured representations of code","author":"Alon","year":"2018","journal-title":"arXiv:1808.01400"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1111\/j.1749-818X.2010.00187.x"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/ICITEED.2015.7408907"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-020-10139-6"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/s40745-020-00253-5"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i16.17662"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/3022671.2984041"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/578"},{"key":"ref64","article-title":"CodeSearchNet challenge: Evaluating the state of semantic code search","author":"Husain","year":"2019","journal-title":"arXiv:1909.09436"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-019-0192-5"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1145\/2786805.2786849"},{"key":"ref67","article-title":"Code llama: Open foundation models for code","author":"Rozi\u00e8re","year":"2023","journal-title":"arXiv:2308.12950"},{"key":"ref68","article-title":"CodeGen: An open large language model for code with multi-turn program synthesis","author":"Nijkamp","year":"2023","journal-title":"arXiv:2203.13474"},{"key":"ref69","article-title":"Learning transferable visual models from natural language supervision","author":"Radford","year":"2021","journal-title":"arXiv:2103.00020"},{"key":"ref70","article-title":"Transformer-based program synthesis through abstract syntax trees","author":"Shree","year":"2023"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.emnlp-main.685"},{"issue":"1","key":"ref72","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3310339","article-title":"Angelix: Scalable multiline program repair via symbolic analysis","volume":"38","author":"Xie","year":"2016","journal-title":"ACM Trans. Program. Languages Syst."},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/icse.2009.5070536"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/4235\/11635978\/11358901.pdf?arnumber=11358901","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,3]],"date-time":"2026-08-03T19:02:44Z","timestamp":1785783764000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11358901\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":73,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2026.3655808","relation":{},"ISSN":["1089-778X","1089-778X","1941-0026"],"issn-type":[{"value":"1089-778X","type":"print"},{"value":"1089-778X","type":"print"},{"value":"1941-0026","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8]]}}}