{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:58:55Z","timestamp":1750309135230,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T00:00:00Z","timestamp":1726012800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NSF (National Science Foundation)","award":["2008640"],"award-info":[{"award-number":["2008640"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,9,11]]},"DOI":"10.1145\/3650212.3652118","type":"proceedings-article","created":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T11:44:25Z","timestamp":1726055065000},"page":"162-173","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Interprocedural Path Complexity Analysis"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-1870-3674","authenticated-orcid":false,"given":"Mira","family":"Kaniyur","sequence":"first","affiliation":[{"name":"Harvey Mudd College, Claremont, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-3876-0629","authenticated-orcid":false,"given":"Ana","family":"Cavalcante-Studart","sequence":"additional","affiliation":[{"name":"Harvey Mudd College, Claremont, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-0134-1007","authenticated-orcid":false,"given":"Yihan","family":"Yang","sequence":"additional","affiliation":[{"name":"Harvey Mudd College, Claremont, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-6920-527X","authenticated-orcid":false,"given":"Sangeon","family":"Park","sequence":"additional","affiliation":[{"name":"Harvey Mudd College, Claremont, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-5069-8235","authenticated-orcid":false,"given":"David","family":"Chen","sequence":"additional","affiliation":[{"name":"Harvey Mudd College, Claremont, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-8690-0117","authenticated-orcid":false,"given":"Duy","family":"Lam","sequence":"additional","affiliation":[{"name":"Harvey Mudd College, Claremont, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2711-5548","authenticated-orcid":false,"given":"Lucas","family":"Bang","sequence":"additional","affiliation":[{"name":"Harvey Mudd College, Claremont, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,9,11]]},"reference":[{"volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Anand Saswat","unstructured":"Saswat Anand, Patrice Godefroid, and Nikolai Tillmann. 2008. Demand-Driven Compositional Symbolic Execution. In Tools and Algorithms for the Construction and Analysis of Systems, C. R. Ramakrishnan and Jakob Rehof (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 367\u2013381. isbn:978-3-540-78800-3","key":"e_1_3_2_1_1_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/2786805.2786863"},{"key":"e_1_3_2_1_3_1","volume-title":"Metrinome: Path Complexity Predicts Symbolic Execution Path Explosion. In 43rd IEEE\/ACM International Conference on Software Engineering: Companion Proceedings, ICSE Companion 2021","author":"Bessler Gabriel","year":"2021","unstructured":"Gabriel Bessler, Josh Cordova, Shaheen Cullen-Baratloo, Sofiane Dissem, Emily Lu, Sofia Devin, Ibrahim Abughararh, and Lucas Bang. 2021. Metrinome: Path Complexity Predicts Symbolic Execution Path Explosion. In 43rd IEEE\/ACM International Conference on Software Engineering: Companion Proceedings, ICSE Companion 2021, Madrid, Spain, May 25-28, 2021. IEEE."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1109\/ICPC.2010.49"},{"volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Boonstoppel Peter","unstructured":"Peter Boonstoppel, Cristian Cadar, and Dawson Engler. 2008. RWset: Attacking Path Explosion in Constraint-Based Test Generation. In Tools and Algorithms for the Construction and Analysis of Systems, C. R. Ramakrishnan and Jakob Rehof (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 351\u2013366. isbn:978-3-540-78800-3","key":"e_1_3_2_1_5_1"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the 8th USENIX Conference on Operating Systems Design and Implementation (OSDI\u201908)","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 Proceedings of the 8th USENIX Conference on Operating Systems Design and Implementation (OSDI\u201908). USENIX Association, USA. 209\u2013224."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/3194164.3194186"},{"key":"e_1_3_2_1_8_1","volume-title":"Braffort and D. Hirschberg (Eds.) (Studies in Logic and the Foundations of Mathematics","volume":"161","author":"Chomsky N.","unstructured":"N. Chomsky and M.P. Sch\u00fctzenberger. 1959. The Algebraic Theory of Context-Free Languages. In Computer Programming and Formal Systems, P. Braffort and D. Hirschberg (Eds.) (Studies in Logic and the Foundations of Mathematics, Vol. 26). Elsevier, 118\u2013161."},{"doi-asserted-by":"publisher","unstructured":"Nasir Eisty George Thiruvathukal and Jeffrey Carver. 2018. A Survey of Software Metric Use in Research Software Development. 212\u2013222. https:\/\/doi.org\/10.1109\/eScience.2018.00036 10.1109\/eScience.2018.00036","key":"e_1_3_2_1_9_1","DOI":"10.1109\/eScience.2018.00036"},{"doi-asserted-by":"crossref","unstructured":"P. Flajolet and R. Sedgewick. 2009. Analytic Combinatorics. Cambridge University Press. isbn:9781139477161","key":"e_1_3_2_1_10_1","DOI":"10.1017\/CBO9780511801655"},{"key":"e_1_3_2_1_11_1","volume-title":"Concrete Mathematics: A Foundation for Computer Science","author":"Graham Robert L.","year":"1994","unstructured":"Robert L. Graham, Donald E. Knuth, and Oren Patashnik. 1994. Concrete Mathematics: A Foundation for Computer Science (2nd ed.). Addison-Wesley Publishing Company, USA. isbn:0201558025","edition":"2"},{"key":"e_1_3_2_1_12_1","volume-title":"Shallit","author":"Gruber Hermann","year":"2012","unstructured":"Hermann Gruber, Jonathan Lee, and Jeffrey O. Shallit. 2012. Enumerating regular expressions and their languages. CoRR, abs\/1204.4982 (2012)."},{"key":"e_1_3_2_1_13_1","volume-title":"Elements of Software Science (Operating and Programming Systems Series)","author":"Halstead Maurice H.","year":"2057","unstructured":"Maurice H. Halstead. 1977. Elements of Software Science (Operating and Programming Systems Series). Elsevier Science Inc., USA. isbn:0444002057"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1109\/ATS.2010.19"},{"unstructured":"H. Levy and F. Lessman. 1992. Finite Difference Equations. Dover Publications. isbn:9780486672601 lccn:lc92020438","key":"e_1_3_2_1_15_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1109\/TSE.1976.233837"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/42372.42379"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1016\/j.jss.2017.03.044"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1109\/FormaliSE58978.2023.00016"},{"key":"e_1_3_2_1_20_1","volume-title":"Software Engineering: A Practitioner\u2019s Approach","author":"Pressman R.S.","year":"2019","unstructured":"R.S. Pressman and B.R. Maxim. 2019. Software Engineering: A Practitioner\u2019s Approach. McGraw-Hill Education. isbn:9781259872976 lccn:2019017652"},{"unstructured":"R. Sedgewick and P. Flajolet. 2013. An Introduction to the Analysis of Algorithms: Introdu Analysi Algori_p2. Pearson Education. isbn:9780133373486","key":"e_1_3_2_1_21_1"},{"key":"e_1_3_2_1_22_1","volume-title":"Introduction to the Theory of Computation","author":"Sipser Michael","year":"1877","unstructured":"Michael Sipser. 2013. Introduction to the Theory of Computation (third ed.). Course Technology, Boston, MA. isbn:113318779X"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1002\/smr.4360070604"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1017\/CBO9781139058520"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1109\/I2CT54291.2022.9824923"},{"unstructured":"Herbert S. Wilf. 2006. Generatingfunctionology. A. K. Peters Ltd. USA. isbn:1568812795","key":"e_1_3_2_1_26_1"}],"event":{"sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering","AITO"],"acronym":"ISSTA '24","name":"ISSTA '24: 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis","location":"Vienna Austria"},"container-title":["Proceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3650212.3652118","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3650212.3652118","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:50:06Z","timestamp":1750287006000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3650212.3652118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,11]]},"references-count":26,"alternative-id":["10.1145\/3650212.3652118","10.1145\/3650212"],"URL":"https:\/\/doi.org\/10.1145\/3650212.3652118","relation":{},"subject":[],"published":{"date-parts":[[2024,9,11]]},"assertion":[{"value":"2024-09-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}