{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,3]],"date-time":"2026-08-03T19:57:27Z","timestamp":1785787047204,"version":"3.56.0"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Rel."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/tr.2026.3712009","type":"journal-article","created":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T19:43:09Z","timestamp":1783626189000},"page":"2668-2682","source":"Crossref","is-referenced-by-count":0,"title":["A Reinforcement Learning-Driven Adversarial Attack Methods With Dynamic Perturbation Optimization"],"prefix":"10.1109","volume":"75","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8575-4172","authenticated-orcid":false,"given":"Lulu","family":"Wang","sequence":"first","affiliation":[{"name":"Southeast University","place":["Nanjing, China"],"department":["Department of Computer Science and Engineering"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-2805-0315","authenticated-orcid":false,"given":"Xiaoyi","family":"Wang","sequence":"additional","affiliation":[{"name":"Southeast University","place":["Nanjing, China"],"department":["Department of Computer Science and Engineering"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3728-9541","authenticated-orcid":false,"given":"Xiaoning","family":"Du","sequence":"additional","affiliation":[{"name":"Monash University","place":["Melbourne, VIC, Australia"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0052-6198","authenticated-orcid":false,"given":"Jianming","family":"Chang","sequence":"additional","affiliation":[{"name":"Southeast University","place":["Nanjing, China"],"department":["Department of Computer Science and Engineering"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9916-4790","authenticated-orcid":false,"given":"Bixin","family":"Li","sequence":"additional","affiliation":[{"name":"Southeast University","place":["Nanjing, China"],"department":["Department of Computer Science and Engineering"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1536","article-title":"CodeBERT: A pre-trained model for programming and natural languages","volume-title":"Proc. Findings Assoc. Comput. Linguistics","author":"Feng","year":"2020"},{"key":"ref2","article-title":"GraphCodeBERT: Pre-training code representations with data flow","author":"Guo","year":"2020"},{"key":"ref3","first-page":"8696","article-title":"CodeT5: Identifier-aware unified pre-trained encoder-decoder models for code understanding and generation","volume-title":"Proc. Conf. Empir. Methods Natural Lang. Process.","author":"Wang","year":"2021"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/COMPSAC54236.2022.00277"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2023.05.016"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3665348.3665391"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/icse55347.2025.00034"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3632742"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3551349.3556927"},{"key":"ref10","first-page":"130","article-title":"Predicting buggy code clones through machine learning","volume-title":"Proc. 32nd Annu. Int. Conf. Comput. Sci. Softw. Eng.","author":"Islam","year":"2022"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2020.107332"},{"key":"ref12","article-title":"ELECTRA: Pre-training text encoders as discriminators rather than generators","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Clark","year":"2020"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3630010"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3510003.3510181"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3510003.3510146"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3428230"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3688839"},{"key":"ref18","first-page":"225","article-title":"Pre-trained models: Past, present and future","volume-title":"AI Open","volume":"2","author":"Han","year":"2021"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s11431-020-1647-3"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3533767.3534390"},{"key":"ref21","first-page":"4171","article-title":"BERT: Pre-training of deep bidirectional transformers for language understanding","volume-title":"Proc. Conf. North Amer. Chapter Assoc. Comput. Linguistics: Hum. Lang. Technol.","author":"Devlin","year":"2019"},{"key":"ref22","first-page":"6000","article-title":"Attention is all you need","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Vaswani","year":"2017"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.acl-long.499"},{"key":"ref24","article-title":"CodeXGLUE: A machine learning benchmark dataset for code understanding and generation","volume-title":"Proc. Neural Inf. Process. Syst. (NeurIPS) Track Datasets Benchmarks","author":"Lu","year":"2021"},{"key":"ref25","article-title":"Language models are unsupervised multitask learners","author":"OpenAI","year":"2019"},{"key":"ref26","first-page":"2655","article-title":"Unified pre-training for program understanding and generation","volume-title":"Proc. Conf. North Amer. Chapter Assoc. Comput. Linguistics: Hum. Lang. Technol.","author":"Ahmad","year":"2021"},{"issue":"140","key":"ref27","first-page":"1","article-title":"Exploring the limits of transfer learning with a unified text-to-text transformer","volume":"21","author":"Raffel","year":"2020","journal-title":"J. Mach. Learn. Res."},{"key":"ref28","first-page":"40","article-title":"CoTexT: Multi-task learning with code-text transformer","volume-title":"Proc. 1st Workshop Natural Lang. Process. Program.","author":"Phan","year":"2021"},{"key":"ref29","article-title":"Code LLaMA: Open foundation models for code","author":"Roziere","year":"2023"},{"key":"ref30","article-title":"The LLaMA 3 herd of models","author":"Grattafiori","year":"2024"},{"key":"ref31","article-title":"Deepseek-coder: When the large language model meets programmingthe rise of code intelligence","author":"Guo","year":"2024"},{"key":"ref32","article-title":"Qwen3-coder-next technical report","author":"Cao","year":"2026"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10515-024-00464-7"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3290353"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3511887"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/saner56733.2023.00076"},{"key":"ref37","first-page":"1169","article-title":"Generating adversarial examples for holding robustness of source code processing models","volume-title":"Proc. AAAI Conf. Artif. Intell.","author":"Zhang","year":"2020"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3501256"},{"key":"ref39","first-page":"9706","article-title":"A black-box attack on code models via representation nearest neighbor search","volume-title":"Proc. Findings Assoc. Comput. Linguistics","author":"Zhang","year":"2023"},{"key":"ref40","first-page":"7777","article-title":"DIP: Dead code insertion based black-box attack for programming language model","volume-title":"Proc. 61st Annu. Meeting Assoc. Comput. Linguistics","author":"Na","year":"2023"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3591227"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/SANER60148.2024.00067"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1002\/smr.2571"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.jisa.2025.104258"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.3390\/s23094350"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1063\/5.0199407"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.bspc.2024.106603"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3346875"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpa.2022.100429"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2022.3208239"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2021.106552"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/SANER53432.2022.00070"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/SANER56733.2023.00043"},{"key":"ref54","first-page":"14892","article-title":"CodeAttack: Code-based adversarial attacks for pre-trained programming language models","volume-title":"Proc. AAAI Conf. Artif. Intell.","author":"Jha","year":"2023"},{"key":"ref55","first-page":"1069","article-title":"CodeT5: Open code large language models for code understanding and generation","volume-title":"Proc. Conf. Empir. Methods Natural Lang. Process.","author":"Wang","year":"2023"},{"key":"ref56","article-title":"CodeBLEU: A method for automatic evaluation of code synthesis","author":"Ren","year":"2020"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.3115\/1073083.1073135"}],"container-title":["IEEE Transactions on Reliability"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/24\/11317936\/11602697.pdf?arnumber=11602697","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,3]],"date-time":"2026-08-03T19:03:02Z","timestamp":1785783782000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11602697\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":57,"URL":"https:\/\/doi.org\/10.1109\/tr.2026.3712009","relation":{},"ISSN":["0018-9529","1558-1721"],"issn-type":[{"value":"0018-9529","type":"print"},{"value":"1558-1721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}