{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T02:36:18Z","timestamp":1784169378921,"version":"3.55.0"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62402482"],"award-info":[{"award-number":["62402482"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61902015"],"award-info":[{"award-number":["61902015"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"CCF-Huawei Populus Grove Fund","award":["CCF-HuaweiSE202407"],"award-info":[{"award-number":["CCF-HuaweiSE202407"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IIEEE Trans. Software Eng."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1109\/tse.2025.3589634","type":"journal-article","created":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T17:38:56Z","timestamp":1752687536000},"page":"2472-2493","source":"Crossref","is-referenced-by-count":5,"title":["Prompt Alchemy: Automatic Prompt Refinement for Enhancing Code Generation"],"prefix":"10.1109","volume":"51","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-1322-5328","authenticated-orcid":false,"given":"Sixiang","family":"Ye","sequence":"first","affiliation":[{"name":"Beijing University of Chemical Technology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9990-9120","authenticated-orcid":false,"given":"Zeyu","family":"Sun","sequence":"additional","affiliation":[{"name":"National Key Laboratory of Space Integrated Information System, Institute of Software, Chinese Academy of Sciences, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-5208-4750","authenticated-orcid":false,"given":"Guoqing","family":"Wang","sequence":"additional","affiliation":[{"name":"Key Laboratory of High Confidence Software Technologies, Ministry of Education, Peking University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-1273-7920","authenticated-orcid":false,"given":"Liwei","family":"Guo","sequence":"additional","affiliation":[{"name":"Beijing University of Chemical Technology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1697-3451","authenticated-orcid":false,"given":"Qingyuan","family":"Liang","sequence":"additional","affiliation":[{"name":"Key Laboratory of High Confidence Software Technologies, Ministry of Education, Peking University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3938-7033","authenticated-orcid":false,"given":"Zheng","family":"Li","sequence":"additional","affiliation":[{"name":"Beijing University of Chemical Technology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1754-3039","authenticated-orcid":false,"given":"Yong","family":"Liu","sequence":"additional","affiliation":[{"name":"Beijing University of Chemical Technology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Evaluating large language models trained on code","author":"Chen","year":"2021"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3368089.3417058"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3690635"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1109\/ICSE-FoSE59343.2023.00008","article-title":"Large language models for software engineering: Survey and open problems","author":"Fan","year":"2023"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3639478.3643108"},{"key":"ref6","article-title":"Chain-of-thought hub: A continuous effort to measure large language models\u2019 reasoning performance","author":"Fu","year":"2023"},{"key":"ref7","article-title":"Connecting large language models with evolutionary algorithms yields powerful prompt optimizers","author":"Guo","year":"2024"},{"key":"ref8","first-page":"61060","article-title":"Infoprompt: Information-theoretic soft prompt tuning for natural language understanding","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"36","author":"Wu","year":"2023"},{"issue":"8","key":"ref9","article-title":"Language models are unsupervised multitask learners","volume":"1","author":"Radford","year":"2019","journal-title":"OpenAI Blog"},{"key":"ref10","article-title":"Language models are few-shot learners","author":"Mann","year":"2020"},{"key":"ref11","article-title":"Agentcoder: Multi-agent-based code generation with iterative testing and optimisation","author":"Huang","year":"2024"},{"key":"ref12","doi-asserted-by":"crossref","DOI":"10.18653\/v1\/2024.findings-acl.49","article-title":"Debug like a human: A large language model debugger via verifying runtime execution step-by-step","author":"Zhong","year":"2024"},{"key":"ref13","article-title":"Large language models are human-level prompt engineers","author":"Zhou","year":"2023"},{"key":"ref14","article-title":"Large language models as optimizers","author":"Yang","year":"2024"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3597503.3639183"},{"key":"ref16","article-title":"Wizardcoder: Empowering code large language models with evol-instruct","author":"Luo","year":"2023"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.acl-long.176"},{"key":"ref18","author":"Radford","year":"2018","journal-title":"Improving Language Understanding by Generative Pre-Training"},{"key":"ref19","first-page":"1877","article-title":"Language models are few-shot learners","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Brown","year":"2020"},{"key":"ref20","article-title":"Constitutional AI: Harmlessness from AI feedback","author":"Bai","year":"2022"},{"key":"ref21","article-title":"Training a helpful and harmless assistant with reinforcement learning from human feedback","author":"Bai","year":"2022"},{"key":"ref22","article-title":"Deepseek-v2: A strong, economical, and efficient mixture-of-experts language model","year":"2024"},{"key":"ref23","article-title":"Deepseek-coder: When the large language model meets programming \u2013 The rise of code intelligence","author":"Guo","year":"2024"},{"key":"ref24","article-title":"Deepseek-v3 technical report","author":"Liu","year":"2024"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3520312.3534862"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3540250.3549113"},{"key":"ref27","first-page":"24824","article-title":"Chain-of-thought prompting elicits reasoning in large language models","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"35","author":"Wei","year":"2022"},{"key":"ref28","doi-asserted-by":"crossref","DOI":"10.18653\/v1\/2023.emnlp-main.494","article-title":"Automatic prompt optimization with \u2018gradient descent\u2019 and beam search","author":"Pryzant","year":"2023"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10270-024-01235-4"},{"key":"ref30","article-title":"Proximal policy optimization algorithms","author":"Schulman","year":"2017"},{"key":"ref31","article-title":"Direct preference optimization: Your language model is secretly a reward model","author":"Rafailov","year":"2024"},{"key":"ref32","doi-asserted-by":"crossref","DOI":"10.1145\/3672459","article-title":"Self-collaboration code generation via chatgpt","author":"Dong","year":"2024"},{"key":"ref33","article-title":"Program synthesis with large language models","author":"Austin","year":"2021"},{"key":"ref34","first-page":"21558","article-title":"Is your code generated by chatgpt really correct? Rigorous evaluation of large language models for code generation","volume-title":"Proc. 37th Int. Conf. Neural Inf. Process. Syst. (NIPS)","author":"Liu","year":"2024"},{"key":"ref35","article-title":"Livecodebench: Holistic and contamination free evaluation of large language models for code","author":"Jain","year":"2024"},{"key":"ref36","article-title":"Codenet: A large-scale AI for code dataset for learning a diversity of coding tasks","author":"Puri","year":"2021"},{"key":"ref37","doi-asserted-by":"crossref","DOI":"10.18653\/v1\/2023.findings-acl.143","article-title":"Avatar: A parallel corpus for java-python program translation","author":"Ahmad","year":"2023"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3597503.3639226"},{"key":"ref39","article-title":"Codecot: Tackling code syntax errors in cot reasoning for code generation","author":"Huang","year":"2024"},{"key":"ref40","doi-asserted-by":"crossref","DOI":"10.18653\/v1\/2024.acl-long.269","article-title":"Mapcoder: Multi-agent code generation for competitive problem solving","author":"Islam","year":"2024"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3697010"},{"key":"ref42","article-title":"Codet: Code generation with generated tests","author":"Chen","year":"2022"},{"key":"ref43","article-title":"Codegen: An open large language model for code with multi-turn program synthesis","author":"Nijkamp","year":"2022"},{"key":"ref44","article-title":"Codebleu: A method for automatic evaluation of code synthesis","author":"Ren","year":"2020"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2024.3440503"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3695991"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.emnlp-main.859"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.findings-emnlp.337"},{"key":"ref49","article-title":"Learning to reason with large language models","year":"2024"}],"container-title":["IEEE Transactions on Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/32\/11172729\/11082010.pdf?arnumber=11082010","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T17:37:10Z","timestamp":1758303430000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11082010\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9]]},"references-count":49,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tse.2025.3589634","relation":{},"ISSN":["0098-5589","1939-3520","2326-3881"],"issn-type":[{"value":"0098-5589","type":"print"},{"value":"1939-3520","type":"electronic"},{"value":"2326-3881","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9]]}}}