{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T06:11:28Z","timestamp":1761977488693,"version":"build-2065373602"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T00:00:00Z","timestamp":1752624000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T00:00:00Z","timestamp":1752624000000},"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":[],"published-print":{"date-parts":[[2025,7,16]]},"DOI":"10.1109\/qrs-c65679.2025.00092","type":"proceedings-article","created":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T17:10:04Z","timestamp":1761930604000},"page":"721-728","source":"Crossref","is-referenced-by-count":0,"title":["Research on Automatic Detection of Infeasible Paths Based on Symbolic Execution and Constraint Solving"],"prefix":"10.1109","author":[{"given":"Wenhao","family":"Shi","sequence":"first","affiliation":[{"name":"Captital University of Economics and Business,Beijing,China"}]},{"given":"Zeyu","family":"Wang","sequence":"additional","affiliation":[{"name":"Beihang University,Beijing,China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-0896-3_29"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1287624.1287655"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2007.06.006"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1049\/iet-sen.2009.0092"},{"issue":"3","key":"ref5","first-page":"74","article-title":"Research on Path Feasibility Detection Based on Symbolic Execution and Data Mining[J]","volume":"1","author":"Yu","year":"2013","journal-title":"Computer and Modernization"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2015.05.007"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2013.11.005"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2014.07.012"},{"key":"ref9","article-title":"Detecting Infeasible Paths Based on Program Slicing And Symbolic Execution[D]","author":"Lanqing","year":"2016","journal-title":"Nanjing University of Posts and Telecommunications"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2918558"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICSPIS51611.2020.9349588"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISSRE55969.2022.00054"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejtl.2024.100131"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2024.103183"}],"event":{"name":"2025 25th International Conference on Software Quality, Reliability, and Security Companion (QRS-C)","start":{"date-parts":[[2025,7,16]]},"location":"Hangzhou, China","end":{"date-parts":[[2025,7,20]]}},"container-title":["2025 25th International Conference on Software Quality, Reliability, and Security Companion (QRS-C)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11216429\/11216154\/11216601.pdf?arnumber=11216601","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T06:06:37Z","timestamp":1761977197000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11216601\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,16]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/qrs-c65679.2025.00092","relation":{},"subject":[],"published":{"date-parts":[[2025,7,16]]}}}