{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T17:38:27Z","timestamp":1781804307717,"version":"3.54.5"},"reference-count":67,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["61472318"],"award-info":[{"award-number":["61472318"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["61572481"],"award-info":[{"award-number":["61572481"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["61632015"],"award-info":[{"award-number":["61632015"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1149454"],"award-info":[{"award-number":["CCF-1149454"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1500024"],"award-info":[{"award-number":["CCF-1500024"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DGE-1522883"],"award-info":[{"award-number":["DGE-1522883"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IIEEE Trans. Software Eng."],"published-print":{"date-parts":[[2018,1,1]]},"DOI":"10.1109\/tse.2017.2659751","type":"journal-article","created":{"date-parts":[[2017,1,26]],"date-time":"2017-01-26T21:10:04Z","timestamp":1485465004000},"page":"25-43","source":"Crossref","is-referenced-by-count":27,"title":["Eliminating Path Redundancy via Postconditioned Symbolic Execution"],"prefix":"10.1109","volume":"44","author":[{"given":"Qiuping","family":"Yi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zijiang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shengjian","family":"Guo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7557-8347","authenticated-orcid":false,"given":"Jian","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chen","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73368-3_52"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/129393.129398"},{"key":"ref33","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/978-3-642-22110-1_45","article-title":"Interpolation-based software verification with wolverine","author":"kroening","year":"2011","journal-title":"Proc 23rd Int Conf Comput Aided Verification"},{"key":"ref32","first-page":"106","article-title":"Algorithms for software model checking: Predicate abstraction versus impact","author":"beyer","year":"2012","journal-title":"Proc Formal Methods Comput -Aided Des"},{"key":"ref31","first-page":"396","article-title":"Unbounded symbolic execution for program verification","author":"jaffar","year":"2011","journal-title":"Proceedings of the 2nd International Conference on Runtime Verification"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2491411.2491425"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1007\/978-3-642-31424-7_48","article-title":"UFO: A framework for abstraction- and\n interpolation-based software verification","author":"albarghouthi","year":"2012","journal-title":"Proc 24th Int Conf Comput Aided Verification"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27940-9_4"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-3-642-11319-2_12","article-title":"Interpolant strength","author":"d'silva","year":"2010","journal-title":"Proc Int Conf Verification Model Checking Abstract Interpretation"},{"key":"ref34","first-page":"556","article-title":"Wolverine:\n Battling bugs with interpolants-(competition contribution)","author":"weissenbacher","year":"2012","journal-title":"Proc Int Conf Tools and Algorithms Constr and Anal Syst"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/2001420.2001423"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/2451116.2451152"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/1755913.1755946"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2015.80"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1007\/978-3-642-31424-7_61","article-title":"TRACER: A symbolic\n execution tool for verification","author":"jaffar","year":"2012","journal-title":"Proc 24th Int Conf Comput Aided Verification"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993558"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78800-3_33"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2012.6227146"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2013.6606713"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11164-3_27"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1145\/2338965.2336771"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065036"},{"key":"ref1","first-page":"209","article-title":"KLEE:\n Unassisted and automatic generation of high-coverage tests for complex systems programs","author":"cadar","year":"2008","journal-title":"Proc USENIX Symp on Operating System Design and Implementation"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1390630.1390635"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1831708.1831732"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/1713254.1713257","article-title":"Cloud9: A software testing service","volume":"43","author":"ciortea","year":"2009","journal-title":"Operating Syst Rev"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2012.114"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2384616.2384654"},{"key":"ref26","first-page":"178","article-title":"The yogi project: Software property\n checking via static analysis and testing","author":"nori","year":"2009","journal-title":"Proc Int Conf Tools and Algorithms Constr and Anal Syst"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/11817963_14","article-title":"Lazy abstraction with interpolants","author":"mcmillan","year":"2006","journal-title":"Proc Int Conf Comput Aided Verification"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/2568225.2568293"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/1966445.1966475"},{"key":"ref59","first-page":"95","article-title":"Directed symbolic execution","author":"ma","year":"2011","journal-title":"Proc 18th Int Symp Static Anal"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/2635868.2635872"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/2509136.2509553"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2015.2490067"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2013.6693084"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/1985793.1985971"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.2010.5609565"},{"key":"ref52","first-page":"842","article-title":"MultiSE: Multi-path symbolic execution using value\n summaries","author":"sen","year":"2015","journal-title":"Proc Power Eng Meeting"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2013.6606558"},{"key":"ref11","first-page":"49","article-title":"Under-constrained symbolic execution: Correctness checking for real code","author":"ramos","year":"2015","journal-title":"24th USENIX Security Symp"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78800-3_28"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1950365.1950396"},{"key":"ref13","first-page":"891","article-title":"Hercules: reproducing crashes in real-world application binaries","author":"pham","year":"2015","journal-title":"Proceedings of the International Conference on Software Engineering ICSE'94"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1190216.1190226"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2007.41"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/978-3-642-14295-6_10","article-title":"Lazy annotation for program testing and verification","author":"mcmillan","year":"2010","journal-title":"Proc Int Conf Comput Aided Verification"},{"key":"ref17","first-page":"297","article-title":"Efficient memoization for dynamic programming with ad-hoc constraints","author":"jaffar","year":"2008","journal-title":"Proc 23rd Nat Conf Artif Intell"},{"key":"ref18","first-page":"454","article-title":"An\n interpolation method for CLP traversal","author":"jaffar","year":"2009","journal-title":"Proc Int Conf Principles Practice Constraint Program"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31424-7_43"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1145\/1095430.1081750","article-title":"CUTE: A concolic unit\n testing engine for C","author":"sen","year":"2005","journal-title":"Proc 2nd ACM SIGSOFT Symp on Foundations of Software Engineering"},{"key":"ref3","first-page":"151","article-title":"Automated whitebox fuzz testing","author":"godefroid","year":"2008","journal-title":"Proc Usenix Symp Netw Distrib Syst Security"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2008.69"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_38"},{"key":"ref8","first-page":"283","article-title":"AEG: Automatic exploit generation","author":"avgerinos","year":"2011","journal-title":"Proc Usenix Symp Netw Distrib Syst Security"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/s10009-009-0118-1","article-title":"A survey of new trends in symbolic execution for software testing and analysis","volume":"11","author":"pasareanu","year":"2009","journal-title":"Int J Softw Tools Technol Transfer"},{"key":"ref49","first-page":"199","article-title":"Redundant state detection for dynamic symbolic execution","author":"bugrara","year":"2013","journal-title":"Proc USENIX Annu Tech Conf"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1450058.1450087"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/2771783.2771802"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/2771783.2771806"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/2254064.2254088"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180445"},{"key":"ref42","article-title":"Compositional symbolic execution through program specialization","author":"rojas","year":"2013","journal-title":"Proc 1st Workshop Bytecode Semantics Verification Anal Transformation"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706307"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/2393596.2393665"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2015.79"}],"container-title":["IEEE Transactions on Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/32\/8249562\/7835264-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/32\/8249562\/07835264.pdf?arnumber=7835264","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:48:19Z","timestamp":1649443699000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7835264\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,1]]},"references-count":67,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tse.2017.2659751","relation":{},"ISSN":["0098-5589","1939-3520"],"issn-type":[{"value":"0098-5589","type":"print"},{"value":"1939-3520","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1,1]]}}}