{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:33:29Z","timestamp":1750221209944,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,9,3]],"date-time":"2018-09-03T00:00:00Z","timestamp":1535932800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,9,3]]},"DOI":"10.1145\/3238147.3240731","type":"proceedings-article","created":{"date-parts":[[2018,8,20]],"date-time":"2018-08-20T20:04:36Z","timestamp":1534795476000},"page":"838-843","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Loop path reduction by state pruning"],"prefix":"10.1145","author":[{"given":"Jianxiong","family":"Gao","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven S.","family":"Lumetta","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,9,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2015.2431688"},{"key":"e_1_3_2_1_2_1","volume-title":"Test Generation Using Symbolic Execution. DROPSIDN\/3845 18 (jan","author":"Godefroid Patrice","year":"2012","unstructured":"Patrice Godefroid . 2012. Test Generation Using Symbolic Execution. DROPSIDN\/3845 18 (jan 2012 ). Patrice Godefroid. 2012. Test Generation Using Symbolic Execution. DROPSIDN\/3845 18 (jan 2012)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001420.2001424"},{"volume-title":"Efficient Testing of Different Loop Paths","author":"Huster Stefan","key":"e_1_3_2_1_4_1","unstructured":"Stefan Huster , Sebastian Burg , Hanno Eichelberger , Jo Laufenberg , J\u00fcrgen Ruf , Thomas Kropf , and Wolfgang Rosenstiel . 2015. Efficient Testing of Different Loop Paths . Springer , Cham , 117\u2013131. Stefan Huster, Sebastian Burg, Hanno Eichelberger, Jo Laufenberg, J\u00fcrgen Ruf, Thomas Kropf, and Wolfgang Rosenstiel. 2015. Efficient Testing of Different Loop Paths. Springer, Cham, 117\u2013131."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASWEC.2015.32"},{"volume-title":"ATVA","author":"Obdrz\u00e1lek Jan","key":"e_1_3_2_1_6_1","unstructured":"Jan Obdrz\u00e1lek and Marek Trt\u00edk . 2011. Efficient Loop Navigation for Symbolic Execution .. In ATVA , Vol. 11 . Springer , 453\u2013462. Jan Obdrz\u00e1lek and Marek Trt\u00edk. 2011. Efficient Loop Navigation for Symbolic Execution.. In ATVA, Vol. 11. Springer, 453\u2013462."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1572272.1572299"},{"key":"e_1_3_2_1_8_1","unstructured":"1572299  1572299"},{"key":"e_1_3_2_1_9_1","volume-title":"Zirkel","author":"Siegel Stephen F.","year":"2012","unstructured":"Stephen F. Siegel and Timothy K . Zirkel . 2012 . Loop Invariant Symbolic Execution for Parallel Programs. Springer , Berlin, Heidelberg, 412\u2013427. 1007\/978-3-642-27940-9_27 Stephen F. Siegel and Timothy K. Zirkel. 2012. Loop Invariant Symbolic Execution for Parallel Programs. Springer, Berlin, Heidelberg, 412\u2013427. 1007\/978-3-642-27940-9_27"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2338965.2336772"},{"key":"e_1_3_2_1_11_1","unstructured":"ACM Press New York New York USA 155.  ACM Press New York New York USA 155."},{"key":"e_1_3_2_1_12_1","unstructured":"2336772  2336772"},{"key":"e_1_3_2_1_13_1","volume-title":"Abstracting Path Conditions for Effective Symbolic Execution. (dec","author":"Trt\u00edk Marek","year":"2011","unstructured":"Marek Trt\u00edk . 2011. Abstracting Path Conditions for Effective Symbolic Execution. (dec 2011 ). arXiv: 1112.4703 http:\/\/arxiv.org\/abs\/1112.4703 Marek Trt\u00edk. 2011. Abstracting Path Conditions for Effective Symbolic Execution. (dec 2011). arXiv: 1112.4703 http:\/\/arxiv.org\/abs\/1112.4703"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2950290.2983972"},{"key":"e_1_3_2_1_15_1","volume-title":"IEEE\/IFIP International Conference on. IEEE, 359\u2013368","author":"Xie Tao","year":"2009","unstructured":"Tao Xie , Nikolai Tillmann , Jonathan de Halleux , and Wolfram Schulte . 2009 . Fitness-guided path exploration in dynamic symbolic execution. In Dependable Systems & Networks, 2009. DSN\u201909 . IEEE\/IFIP International Conference on. IEEE, 359\u2013368 . Tao Xie, Nikolai Tillmann, Jonathan de Halleux, and Wolfram Schulte. 2009. Fitness-guided path exploration in dynamic symbolic execution. In Dependable Systems & Networks, 2009. DSN\u201909. IEEE\/IFIP International Conference on. IEEE, 359\u2013368."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2950290.2950340"}],"event":{"name":"ASE '18: 33rd ACM\/IEEE International Conference on Automated Software Engineering","sponsor":["SIGAI ACM Special Interest Group on Artificial Intelligence","CNRS Centre National De La Rechercue Scientifique","SIGSOFT ACM Special Interest Group on Software Engineering","IEEE-CS Computer Society"],"location":"Montpellier France","acronym":"ASE '18"},"container-title":["Proceedings of the 33rd ACM\/IEEE International Conference on Automated Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3238147.3240731","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3238147.3240731","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:41Z","timestamp":1750210781000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3238147.3240731"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,3]]},"references-count":16,"alternative-id":["10.1145\/3238147.3240731","10.1145\/3238147"],"URL":"https:\/\/doi.org\/10.1145\/3238147.3240731","relation":{},"subject":[],"published":{"date-parts":[[2018,9,3]]},"assertion":[{"value":"2018-09-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}