{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:20:38Z","timestamp":1750220438562,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,12,21]],"date-time":"2020-12-21T00:00:00Z","timestamp":1608508800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSFC","award":["61632015, 61690203, 61532007"],"award-info":[{"award-number":["61632015, 61690203, 61532007"]}]},{"name":"National Key R&D Program of China","award":["2017YFB1001802"],"award-info":[{"award-number":["2017YFB1001802"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,12,21]]},"DOI":"10.1145\/3324884.3418904","type":"proceedings-article","created":{"date-parts":[[2021,1,27]],"date-time":"2021-01-27T23:39:02Z","timestamp":1611790742000},"page":"1262-1263","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Synthesizing smart solving strategy for symbolic execution"],"prefix":"10.1145","author":[{"given":"Zehua","family":"Chen","sequence":"first","affiliation":[{"name":"National University of Defense Technology, Changsha, China"}]},{"given":"Zhenbang","family":"Chen","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, Changsha, China"}]},{"given":"Ziqi","family":"Shuai","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, Changsha, China"}]},{"given":"Yufeng","family":"Zhang","sequence":"additional","affiliation":[{"name":"Hunan University, Changsha, China"}]},{"given":"Weiyu","family":"Pan","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, Changsha, China"}]}],"member":"320","published-online":{"date-parts":[[2021,1,27]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Mislav Balunovic Pavol Bielik and Martin Vechev. 2018. Learning to solve SMT formulas. In Advances in Neural Information Processing Systems. 10317--10328."},{"key":"e_1_3_2_1_2_1","volume-title":"CAV","author":"Barrett Clark W.","year":"2011","unstructured":"Clark W. Barrett, Christopher L. Conway, Morgan Deters, Liana Hadarean, Dejan Jovanovic, Tim King, Andrew Reynolds, and Cesare Tinelli. 2011. CVC4. In CAV 2011. 171--177."},{"key":"e_1_3_2_1_3_1","volume-title":"KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs. In OSDI","author":"Cadar Cristian","year":"2008","unstructured":"Cristian Cadar, Daniel Dunbar, and Dawson Engler. 2008. KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs. In OSDI 2008. USENIX Association, USA, 209--224."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408795"},{"volume-title":"Z3: An Efficient SMT Solver","author":"de Moura Leonardo","key":"e_1_3_2_1_5_1","unstructured":"Leonardo de Moura and Nikolaj Bj\u00f8rner. 2008. Z3: An Efficient SMT Solver. In TACAS, C. R. Ramakrishnan and Jakob Rehof (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 337--340."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Leonardo Mendon\u00e7a de Moura and Grant Olney Passmore. 2013. The Strategy Challenge in SMT Solving. In Automated Reasoning and Mathematics - Essays in Memory of William W. McCune. 15--44.","DOI":"10.1007\/978-3-642-36675-8_2"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/360248.360252"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2016.0046"},{"key":"e_1_3_2_1_9_1","first-page":"500","article-title":"A fast decision tree learning algorithm","volume":"6","author":"Su Jiang","year":"2006","unstructured":"Jiang Su and Harry Zhang. 2006. A fast decision tree learning algorithm. In AAAI, Vol. 6. 500--505.","journal-title":"AAAI"},{"key":"e_1_3_2_1_10_1","volume-title":"Dwyer","author":"Visser Willem","year":"2012","unstructured":"Willem Visser, Jaco Geldenhuys, and Matthew B. Dwyer. 2012. Green: Reducing, Reusing and Recycling Constraints in Program Analysis. In FSE 2012. Association for Computing Machinery, New York, NY, USA, 11."},{"key":"e_1_3_2_1_11_1","volume-title":"Speculative Symbolic Execution. In ISSRE","author":"Zhang Yufeng","year":"2012","unstructured":"Yufeng Zhang, Zhenbang Chen, and Ji Wang. 2012. Speculative Symbolic Execution. In ISSRE 2012. 101--110."}],"event":{"name":"ASE '20: 35th IEEE\/ACM International Conference on Automated Software Engineering","sponsor":["SIGAI ACM Special Interest Group on Artificial Intelligence","SIGSOFT ACM Special Interest Group on Software Engineering","IEEE CS"],"location":"Virtual Event Australia","acronym":"ASE '20"},"container-title":["Proceedings of the 35th IEEE\/ACM International Conference on Automated Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3324884.3418904","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3324884.3418904","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:47:23Z","timestamp":1750193243000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3324884.3418904"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,21]]},"references-count":11,"alternative-id":["10.1145\/3324884.3418904","10.1145\/3324884"],"URL":"https:\/\/doi.org\/10.1145\/3324884.3418904","relation":{},"subject":[],"published":{"date-parts":[[2020,12,21]]},"assertion":[{"value":"2021-01-27","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}