{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T00:31:32Z","timestamp":1760056292016,"version":"build-2065373602"},"reference-count":38,"publisher":"World Scientific Pub Co Pte Ltd","issue":"10","funder":[{"name":"the Excellent Scientic Research and Innovation Team of Anhui Colleges","award":["2022AH010098"],"award-info":[{"award-number":["2022AH010098"]}]},{"DOI":"10.13039\/501100019406","name":"Key Research Institute of Humanities and Social Sciences in Sichuan Province","doi-asserted-by":"publisher","award":["2024AH051366"],"award-info":[{"award-number":["2024AH051366"]}],"id":[{"id":"10.13039\/501100019406","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the High-level Talent Research Start-up Fund of Chizhou University","award":["CZ2024YJRC03"],"award-info":[{"award-number":["CZ2024YJRC03"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Soft. Eng. Knowl. Eng."],"published-print":{"date-parts":[[2025,10]]},"abstract":"<jats:p> Program path analysis is an essential component of software defect detection and quality assurance. Accurately identifying infeasible paths can prevent false positives caused by invalid paths, enabling developers to pinpoint actual defects more efficiently and enhancing overall software quality and reliability. This paper proposes an integrated approach for determining infeasible paths based on program path features and constraint-based reinforcement learning. First, a loop-structure path search and reduction algorithm is proposed to systematically simplify path explosion induced by loops. Then, a global subgraph-based path reduction algorithm is introduced to effectively remove redundant and irrelevant paths. Subsequently, we propose a path set generation algorithm guided by control and implication relationships to construct an optimized path set. Path constraints and symbolic path constraints are used to enhance semantic representation. Finally, a reinforcement learning-based model utilizing reachability rewards and exploration rewards to dynamically determine path reachability. Experimental results show that our proposed approach significantly reduces path explosion, accurately identifies infeasible paths and outperforms existing methods in terms of accuracy and computational efficiency. <\/jats:p>","DOI":"10.1142\/s0218194025500457","type":"journal-article","created":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T10:21:59Z","timestamp":1755858119000},"page":"1435-1464","source":"Crossref","is-referenced-by-count":0,"title":["A Reinforcement Learning-Based Approach for Determining Infeasible Paths of Programs"],"prefix":"10.1142","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1919-2498","authenticated-orcid":false,"given":"Peng","family":"Dai","sequence":"first","affiliation":[{"name":"Anhui Education Big Data Intelligent Perception and Application Engineering Research Center, School of Big Data and Artificial Intelligence, Chizhou University, Chizhou 247000, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-6843-4941","authenticated-orcid":false,"given":"Tang","family":"He","sequence":"additional","affiliation":[{"name":"Anhui Education Big Data Intelligent Perception and Application Engineering Research Center, School of Big Data and Artificial Intelligence, Chizhou University, Chizhou 247000, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zebo","family":"Peng","sequence":"additional","affiliation":[{"name":"Anhui Provincial Joint Construction Key Laboratory of Intelligent Education Equipment and Technology, Chizhou 247000, P.\u00a0R.\u00a0China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8614-5080","authenticated-orcid":false,"given":"Chen","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Engineering, Ningbo University of Technology, Ningbo 315211, P.\u00a0R.\u00a0China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunzhan","family":"Gong","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, P.\u00a0R.\u00a0China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2025,9,17]]},"reference":[{"key":"S0218194025500457BIB001","first-page":"64","volume-title":"International Conference on Evaluation of Novel Approaches to Software Engineering","author":"Ding S.","year":"2012"},{"key":"S0218194025500457BIB002","first-page":"259","volume-title":"Proceedings of the 8th International Conference on Software Engineering","author":"Hedley D.","year":"1985"},{"doi-asserted-by":"publisher","key":"S0218194025500457BIB003","DOI":"10.1016\/j.infsof.2007.06.006"},{"doi-asserted-by":"publisher","key":"S0218194025500457BIB004","DOI":"10.1002\/spe.2929"},{"doi-asserted-by":"publisher","key":"S0218194025500457BIB005","DOI":"10.1109\/CSMR-WCRE.2014.6747227"},{"doi-asserted-by":"publisher","key":"S0218194025500457BIB006","DOI":"10.1016\/j.scico.2024.103183"},{"doi-asserted-by":"publisher","key":"S0218194025500457BIB007","DOI":"10.1007\/s13389-023-00310-8"},{"doi-asserted-by":"publisher","key":"S0218194025500457BIB008","DOI":"10.1145\/3460120.3484813"},{"issue":"5","key":"S0218194025500457BIB009","first-page":"1072","volume":"53","author":"Jiang S.","year":"2016","journal-title":"J. Comput. Res. Dev."},{"doi-asserted-by":"publisher","key":"S0218194025500457BIB011","DOI":"10.1109\/ICST.2010.13"},{"doi-asserted-by":"publisher","key":"S0218194025500457BIB012","DOI":"10.1007\/978-3-642-23702-7_11"},{"doi-asserted-by":"publisher","key":"S0218194025500457BIB013","DOI":"10.1145\/1985793.1985995"},{"issue":"6","key":"S0218194025500457BIB014","first-page":"2061","volume":"33","author":"Li G.","year":"2022","journal-title":"J. Softw."},{"doi-asserted-by":"publisher","key":"S0218194025500457BIB015","DOI":"10.1145\/3461648.3463855"},{"doi-asserted-by":"publisher","key":"S0218194025500457BIB017","DOI":"10.1007\/978-3-031-39689-2_7"},{"doi-asserted-by":"publisher","key":"S0218194025500457BIB018","DOI":"10.1145\/3563344"},{"doi-asserted-by":"publisher","key":"S0218194025500457BIB019","DOI":"10.1145\/3182657"},{"doi-asserted-by":"publisher","key":"S0218194025500457BIB020","DOI":"10.1016\/j.jss.2023.111629"},{"doi-asserted-by":"publisher","key":"S0218194025500457BIB021","DOI":"10.1109\/ICSESS47205.2019.9040767"},{"issue":"1","key":"S0218194025500457BIB022","first-page":"4258291","volume":"2020","author":"Song Y.","year":"2020","journal-title":"Math. Probl. Eng."},{"doi-asserted-by":"publisher","key":"S0218194025500457BIB023","DOI":"10.1109\/ICSPIS51611.2020.9349588"},{"doi-asserted-by":"publisher","key":"S0218194025500457BIB024","DOI":"10.1145\/3302516.3307349"},{"doi-asserted-by":"publisher","key":"S0218194025500457BIB025","DOI":"10.1007\/978-981-15-4095-0"},{"doi-asserted-by":"publisher","key":"S0218194025500457BIB026","DOI":"10.1007\/s10664-023-10363-2"},{"key":"S0218194025500457BIB027","first-page":"21314","volume":"35","author":"Le H.","year":"2022","journal-title":"Adv. Neural Inf. Process. Syst."},{"doi-asserted-by":"publisher","key":"S0218194025500457BIB029","DOI":"10.1109\/TSE.2020.2979701"},{"doi-asserted-by":"publisher","key":"S0218194025500457BIB030","DOI":"10.1109\/TSE.2021.3070549"},{"doi-asserted-by":"publisher","key":"S0218194025500457BIB031","DOI":"10.1109\/TSE.2024.3452595"},{"doi-asserted-by":"publisher","key":"S0218194025500457BIB032","DOI":"10.1016\/j.eswa.2021.115446"},{"doi-asserted-by":"publisher","key":"S0218194025500457BIB033","DOI":"10.1145\/3502868"},{"doi-asserted-by":"publisher","key":"S0218194025500457BIB034","DOI":"10.1145\/3377811.3380399"},{"doi-asserted-by":"publisher","key":"S0218194025500457BIB035","DOI":"10.1007\/s10664-024-10500-5"},{"doi-asserted-by":"publisher","key":"S0218194025500457BIB036","DOI":"10.1007\/s11432-023-4127-5"},{"key":"S0218194025500457BIB037","first-page":"4365","volume-title":"31st USENIX Security Symposium","author":"Zhou S.","year":"2022"},{"doi-asserted-by":"publisher","key":"S0218194025500457BIB038","DOI":"10.1134\/S0361768818060051"},{"doi-asserted-by":"publisher","key":"S0218194025500457BIB039","DOI":"10.1016\/j.infsof.2023.107325"},{"doi-asserted-by":"publisher","key":"S0218194025500457BIB040","DOI":"10.1109\/SCAM.2008.12"},{"doi-asserted-by":"publisher","key":"S0218194025500457BIB042","DOI":"10.1142\/S0218194025500123"}],"container-title":["International Journal of Software Engineering and Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218194025500457","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T09:09:24Z","timestamp":1760000964000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0218194025500457"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,17]]},"references-count":38,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["10.1142\/S0218194025500457"],"URL":"https:\/\/doi.org\/10.1142\/s0218194025500457","relation":{},"ISSN":["0218-1940","1793-6403"],"issn-type":[{"type":"print","value":"0218-1940"},{"type":"electronic","value":"1793-6403"}],"subject":[],"published":{"date-parts":[[2025,9,17]]}}}