{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T21:45:39Z","timestamp":1770846339519,"version":"3.50.1"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:00:00Z","timestamp":1759622400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:00:00Z","timestamp":1759622400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100004763","name":"Natural Science Foundation of Inner Mongolia","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004763","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,10,5]]},"DOI":"10.1109\/smc58881.2025.11343040","type":"proceedings-article","created":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T20:54:44Z","timestamp":1769633684000},"page":"181-186","source":"Crossref","is-referenced-by-count":0,"title":["Model-MRFaG: A Test Code Generation Framework Based on Fine-tuned LLMs"],"prefix":"10.1109","author":[{"given":"Xiang","family":"Zhou","sequence":"first","affiliation":[{"name":"Inner Mongolia University,College of Computer Science,Hohhot,China"}]},{"given":"Lei","family":"Yu","sequence":"additional","affiliation":[{"name":"Inner Mongolia University,College of Computer Science,Hohhot,China"}]},{"given":"JunHua","family":"Liu","sequence":"additional","affiliation":[{"name":"Inner Mongolia University,College of Computer Science,Hohhot,China"}]},{"given":"CongHui","family":"Yangand","sequence":"additional","affiliation":[{"name":"Inner Mongolia University,College of Computer Science,Hohhot,China"}]},{"given":"LiXun","family":"Wang","sequence":"additional","affiliation":[{"name":"Inner Mongolia University,College of Computer Science,Hohhot,China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISSRE59848.2023.00075"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE48619.2023.00085"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2025113.2025179"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICSME46990.2020.00056"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref6","article-title":"Neural Unit Test Suggestions","author":"Dinella","year":"2021","journal-title":"CoRR"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE48619.2023.00178"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ASE56229.2023.00193"},{"key":"ref9","article-title":"Code llama: Open foundation models for code","author":"Roziere","year":"2023"},{"key":"ref10","article-title":"Dora: Weight-decomposed low-rank adaptation","volume-title":"Proc. 41st Int. Conf. Machine Learning","author":"Liu"},{"key":"ref11","first-page":"17783","article-title":"LoRA+: Efficient Low Rank Adaptation of Large Models","volume-title":"Proc. Int. Conf. Machine Learning","author":"Hayou"},{"key":"ref12","first-page":"10088","article-title":"Qlora: Efficient finetuning of quantized llms","volume":"36","author":"Dettmers","year":"2023","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref13","article-title":"LongLoRA: Efficient Fine-tuning of Long-Context Large Language Models","volume-title":"Proc. 12th Int. Conf. Learning Representations","author":"Chen"},{"key":"ref14","article-title":"Evaluating large language models trained on code","author":"Chen","year":"2021"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599790"},{"key":"ref16","article-title":"Program synthesis with large language models","author":"Austin","year":"2021"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1108\/ws.2000.07949fab.004"},{"key":"ref18","article-title":"Starcoder 2 and the stack v2: The next generation","author":"Lozhkov","year":"2024"},{"issue":"2","key":"ref19","first-page":"3","article-title":"Lora: Low-rank adaptation of large language models","volume":"1","author":"Hu","year":"2022","journal-title":"ICLR"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155407"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.acl-short.107"},{"key":"ref22","article-title":"Sora: A review on background, technology, limitations, and opportunities of large vision models","author":"Liu","year":"2024"},{"key":"ref23","article-title":"VeRA: Vector-based Random Matrix Adaptation","volume-title":"Proc. 12th Int. Conf. Learning Representations","author":"Kopiczko"},{"key":"ref24","first-page":"9459","article-title":"Retrieval-augmented generation for knowledge-intensive nlp tasks","volume":"33","author":"Lewis","year":"2020","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref25","first-page":"26106","article-title":"Lever: Learning to verify language-to-code generation with execution","volume-title":"Proc. Int. Conf. Machine Learning","author":"Ni"},{"key":"ref26","article-title":"CodeT: Code Generation with Generated Tests","volume-title":"Proc. ICLR","author":"Chen"}],"event":{"name":"2025 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","location":"Vienna, Austria","start":{"date-parts":[[2025,10,5]]},"end":{"date-parts":[[2025,10,8]]}},"container-title":["2025 IEEE International Conference on Systems, Man, and Cybernetics (SMC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11342430\/11342431\/11343040.pdf?arnumber=11343040","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T20:53:13Z","timestamp":1770843193000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11343040\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,5]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/smc58881.2025.11343040","relation":{},"subject":[],"published":{"date-parts":[[2025,10,5]]}}}