{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:14:15Z","timestamp":1750220055898,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T00:00:00Z","timestamp":1679875200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-18-CE25-0015-01"],"award-info":[{"award-number":["ANR-18-CE25-0015-01"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,3,27]]},"DOI":"10.1145\/3555776.3577738","type":"proceedings-article","created":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T17:16:29Z","timestamp":1686158189000},"page":"1716-1723","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Exhaustive Branch Coverage with TreeFrog"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7013-5205","authenticated-orcid":false,"given":"Nicky","family":"Williams","sequence":"first","affiliation":[{"name":"Universit\u00e9 Paris-Saclay, CEA, LIST, F-91120 Palaiseau, France"}]}],"member":"320","published-online":{"date-parts":[[2023,6,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2015.2490067"},{"key":"e_1_3_2_1_2_1","volume-title":"Proc. TACAS 2008","volume":"4963","author":"Boonstoppel P.","year":"2008","unstructured":"P. Boonstoppel , C. Cadar , D.R. Engler . Rwset : Attacking path explosion in constraint-based test generation . In Proc. TACAS 2008 , Lecture Notes in Computer Science vol. 4963 , 351--366. Springer, 2008 . 10.1007\/978-3-540-78800-3\\_27 P. Boonstoppel, C. Cadar, D.R. Engler. Rwset: Attacking path explosion in constraint-based test generation. In Proc. TACAS 2008, Lecture Notes in Computer Science vol. 4963, 351--366. Springer, 2008. 10.1007\/978-3-540-78800-3\\_27"},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. VMCAI 2011","volume":"6538","author":"Bradley A.R.","year":"2011","unstructured":"A.R. Bradley . Sat-based model checking without unrolling . In Proc. VMCAI 2011 , Lecture Notes in Computer Science , vol. 6538 , 70--87. Springer, 2011 . 10.1007\/978-3-642-18275-4\\_7 A.R. Bradley. Sat-based model checking without unrolling. In Proc. VMCAI 2011, Lecture Notes in Computer Science, vol. 6538, 70--87. Springer, 2011. 10.1007\/978-3-642-18275-4\\_7"},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. 3rd Intl. Conf. on Software Testing, Verification and Validation, ICST 2010","author":"Delahaye M.","year":"2010","unstructured":"M. Delahaye , B. Botella , A. Gotlieb . Explanation-based generalization of infeasible path . In Proc. 3rd Intl. Conf. on Software Testing, Verification and Validation, ICST 2010 , 215--224. IEEE, 2010 . 10.1109\/ICST.2010.13 M. Delahaye, B. Botella, A. Gotlieb. Explanation-based generalization of infeasible path. In Proc. 3rd Intl. Conf. on Software Testing, Verification and Validation, ICST 2010, 215--224. IEEE, 2010. 10.1109\/ICST.2010.13"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14288\/1.0165906"},{"key":"e_1_3_2_1_6_1","volume-title":"Proc. FASE 2020","author":"Jaffar J.","year":"2076","unstructured":"J. Jaffar , R. Maghareh , S. Godboley , X. Ha . Tracerx : Dynamic symbolic execution with interpolation . In Proc. FASE 2020 , Lecture Notes in Computer Science, vol 1 2076 , 530--534. Springer, 2020. 10.1007\/978-3-030-45234-6\\_28 J. Jaffar, R. Maghareh, S. Godboley, X. Ha. Tracerx: Dynamic symbolic execution with interpolation. In Proc. FASE 2020, Lecture Notes in Computer Science, vol 12076, 530--534. Springer, 2020. 10.1007\/978-3-030-45234-6\\_28"},{"key":"e_1_3_2_1_7_1","volume-title":"Proc. Joint Meeting of the European Software Engineering Conf. and ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC\/FSE'13)","author":"Jaffar J.","year":"2013","unstructured":"J. Jaffar , V. Murali , J.A. Navas . Boosting concolic testing via interpolation . In Proc. Joint Meeting of the European Software Engineering Conf. and ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC\/FSE'13) , ACM, 2013 , 48--58 10.1145\/2491411.2491425 J. Jaffar, V. Murali, J.A. Navas. Boosting concolic testing via interpolation. In Proc. Joint Meeting of the European Software Engineering Conf. and ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC\/FSE'13), ACM, 2013, 48--58 10.1145\/2491411.2491425"},{"key":"e_1_3_2_1_8_1","first-page":"779","article-title":"Dynamic partitioning strategy to enhance symbolic execution. In Proc. 2016 Design, Automation & Test in Europe Conf. (DATE 2016)","volume":"774","author":"Marcellino B.A.","year":"2016","unstructured":"B.A. Marcellino , M.S. Hsiao . Dynamic partitioning strategy to enhance symbolic execution. In Proc. 2016 Design, Automation & Test in Europe Conf. (DATE 2016) , IEEE , 2016 , 774 -- 779 . B.A. Marcellino, M.S. Hsiao. Dynamic partitioning strategy to enhance symbolic execution. In Proc. 2016 Design, Automation & Test in Europe Conf. (DATE 2016), IEEE, 2016, 774--779.","journal-title":"IEEE"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1109\/ATS.2011.83","volume-title":"Proc. 20th IEEE Asian Test Symposium (ATS 2011","author":"Prabhu S.","year":"2011","unstructured":"S. Prabhu An efficient 2-phase strategy to achieve high branch coverage . In Proc. 20th IEEE Asian Test Symposium (ATS 2011 ), IEEE, 167 - 174 . 10.1109\/ATS. 2011 .83 S. Prabhu et al. An efficient 2-phase strategy to achieve high branch coverage. In Proc. 20th IEEE Asian Test Symposium (ATS 2011), IEEE, 167 -174. 10.1109\/ATS.2011.83"},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. 37th IEEE\/ACM Intl. Conf. on Software Engineering, ICSE 2015, IEEE","volume":"1","author":"Qiu R.","year":"2015","unstructured":"R. Qiu , G. Yang , C.S. Pasareanu , S. Khurshid . Compositional symbolic execution with memoized replay . In Proc. 37th IEEE\/ACM Intl. Conf. on Software Engineering, ICSE 2015, IEEE , Vol. 1 , 632--642. 10.1109\/ICSE. 2015 .79 R. Qiu, G. Yang, C.S. Pasareanu, S. Khurshid. Compositional symbolic execution with memoized replay. In Proc. 37th IEEE\/ACM Intl. Conf. on Software Engineering, ICSE 2015, IEEE, Vol. 1, 632--642. 10.1109\/ICSE.2015.79"},{"key":"e_1_3_2_1_11_1","volume-title":"Proc. 2021 IEEE\/ACM Intl. Conf. on Automation of Software Test (AST","author":"Williams N.","year":"2021","unstructured":"N. Williams . Towards exhaustive branch coverage with PathCrawler . In Proc. 2021 IEEE\/ACM Intl. Conf. on Automation of Software Test (AST 2021 ), IEEE\/ACM, 117--120. N. Williams. Towards exhaustive branch coverage with PathCrawler. In Proc. 2021 IEEE\/ACM Intl. Conf. on Automation of Software Test (AST 2021), IEEE\/ACM, 117--120."},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. 19th IEEE Intl. Conf. on Automated Software Engineering (ASE 2004","author":"Williams N.","year":"2004","unstructured":"N. Williams , B. Marre , P. Mouy . On-the-fly generation of k-path tests for C functions . In Proc. 19th IEEE Intl. Conf. on Automated Software Engineering (ASE 2004 ), IEEE, 290--293. 2004 .10020. 10.1109\/ASE N. Williams, B. Marre, P. Mouy. On-the-fly generation of k-path tests for C functions. In Proc. 19th IEEE Intl. Conf. on Automated Software Engineering (ASE 2004), IEEE, 290--293. 2004.10020. 10.1109\/ASE"},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. 2009 IEEE\/IFIP Intl. Conf. on Dependable Systems and Networks (DSN 2009","author":"Xie T.","year":"2009","unstructured":"T. Xie , N. Tillmann , J. de Halleux , W. Schulte . Fitness-guided path exploration in dynamic symbolic execution . In Proc. 2009 IEEE\/IFIP Intl. Conf. on Dependable Systems and Networks (DSN 2009 ), IEEE, 359--368 10.1109\/DSN. 2009 .5270315 T. Xie, N. Tillmann, J. de Halleux, W. Schulte. Fitness-guided path exploration in dynamic symbolic execution. In Proc. 2009 IEEE\/IFIP Intl. Conf. on Dependable Systems and Networks (DSN 2009), IEEE, 359--368 10.1109\/DSN.2009.5270315"}],"event":{"name":"SAC '23: 38th ACM\/SIGAPP Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Tallinn Estonia","acronym":"SAC '23"},"container-title":["Proceedings of the 38th ACM\/SIGAPP Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3555776.3577738","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3555776.3577738","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:08:29Z","timestamp":1750183709000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3555776.3577738"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,27]]},"references-count":13,"alternative-id":["10.1145\/3555776.3577738","10.1145\/3555776"],"URL":"https:\/\/doi.org\/10.1145\/3555776.3577738","relation":{},"subject":[],"published":{"date-parts":[[2023,3,27]]},"assertion":[{"value":"2023-06-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}