{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:18:17Z","timestamp":1740169097320,"version":"3.37.3"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1736110","61702044","61502029"],"award-info":[{"award-number":["U1736110","61702044","61502029"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["2017RC27"],"award-info":[{"award-number":["2017RC27"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2894593","type":"journal-article","created":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T20:33:37Z","timestamp":1548966817000},"page":"15040-15055","source":"Crossref","is-referenced-by-count":3,"title":["Detecting Interprocedural Infeasible Paths Based on Unsatisfiable Path Constraint Patterns"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6983-8181","authenticated-orcid":false,"given":"Honglei","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Dahai","family":"Jin","sequence":"additional","affiliation":[]},{"given":"Yunzhan","family":"Gong","sequence":"additional","affiliation":[]},{"given":"Ying","family":"Xing","sequence":"additional","affiliation":[]},{"given":"Mingnan","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1142\/S0218194017500334"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2018.2865217"},{"key":"ref10","first-page":"95","article-title":"Using SMT solving for the lookup of infeasible paths in binary programs","author":"ruiz","year":"2015","journal-title":"Proc WCET"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1142\/S0218194001000487"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/RTAS.2014.6926000"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.5815\/ijeme.2017.04.03"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/QRS.2016.26"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-43144-4_3"},{"key":"ref16","first-page":"337","article-title":"Z3: An efficient SMT solver","author":"de moura","year":"2008","journal-title":"Proc TACAS"},{"key":"ref17","first-page":"361","article-title":"Refining data flow information using infeasible paths","author":"bod\u00edk","year":"1997","journal-title":"Proc 6th Eur Softw Eng Conf 5th ACM SIGSOFT Int Symp Found Softw Eng"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.3923\/jse.2012.65.78"},{"key":"ref19","first-page":"1120","article-title":"Infeasible paths detection using static analysis","volume":"2","author":"barhoush","year":"2013","journal-title":"The Research Bulletin of Jordan ACM"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1016\/j.infsof.2007.06.006","article-title":"Heuristics-based infeasible path detection for dynamic test data generation","volume":"50","author":"ngo","year":"2008","journal-title":"Inf Softw Technol"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.3724\/SP.J.1001.2010.03782"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2000.873665"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-024X(200006)30:7<775::AID-SPE309>3.0.CO;2-H"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/267580.267590"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/j.infsof.2014.07.012","article-title":"Infeasible path generalization in dynamic symbolic execution","volume":"58","author":"delahaye","year":"2015","journal-title":"Inf Softw Technol"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1166\/jctn.2015.4151"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0950-5849(91)90024-6"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/978-3-642-45422-6_5","article-title":"Detection of infeasible paths: Approaches and challenges","volume":"410","author":"ding","year":"2012","journal-title":"Eval Nov Approaches to Softw Eng"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/978-3-540-31987-0_3","article-title":"The ASTRE&#x00C9; analyzer","author":"cousot","year":"2005","journal-title":"Programming Languages and Systems"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/186258.186523"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/32.57624"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147002"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1287624.1287655"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CSMR-WCRE.2014.6747227"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2010.13"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2015.05.007"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1049\/iet-sen.2009.0092"},{"key":"ref25","first-page":"1072","article-title":"Detecting infeasible paths based on branch correlations analysis","volume":"53","author":"shujuan","year":"2016","journal-title":"J Comput Res Develop"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08631017.pdf?arnumber=8631017","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T07:13:55Z","timestamp":1643267635000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8631017\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2894593","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}