{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:59:02Z","timestamp":1771700342404,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,8,30]],"date-time":"2015-08-30T00:00:00Z","timestamp":1440892800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1423623"],"award-info":[{"award-number":["CCF-1423623"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["FA8750-15-2-0087"],"award-info":[{"award-number":["FA8750-15-2-0087"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,8,30]]},"DOI":"10.1145\/2786805.2786863","type":"proceedings-article","created":{"date-parts":[[2015,8,26]],"date-time":"2015-08-26T16:48:13Z","timestamp":1440607693000},"page":"61-72","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Automatically computing path complexity of programs"],"prefix":"10.1145","author":[{"given":"Lucas","family":"Bang","sequence":"first","affiliation":[{"name":"University of California at Santa Barbara, USA"}]},{"given":"Abdulbaki","family":"Aydin","sequence":"additional","affiliation":[{"name":"University of California at Santa Barbara, USA"}]},{"given":"Tevfik","family":"Bultan","sequence":"additional","affiliation":[{"name":"University of California at Santa Barbara, USA"}]}],"member":"320","published-online":{"date-parts":[[2015,8,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21690-4_15"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/648236.753767"},{"key":"e_1_3_2_1_3_1","volume-title":"Algebraic Graph Theory","author":"Biggs N.","year":"1993"},{"key":"e_1_3_2_1_4_1","volume-title":"Cengage Learning","author":"Burden R.","year":"2010"},{"key":"e_1_3_2_1_5_1","first-page":"224","volume-title":"Proc. 8th Symp. Operating Systems Design and Implementation (OSDI)","author":"Cadar Cristian","year":"2008"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062455.1062533"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1348250.1348254"},{"key":"e_1_3_2_1_8_1","first-page":"340","volume-title":"Proc. 14th Int. Conf. Tools and Algorithms for the Construction and Analysis of Systems (TACAS)","author":"Leonardo","year":"2008"},{"key":"e_1_3_2_1_9_1","volume-title":"Approximation for the path complexity of binary search tree. CoRR, abs\/1404.4692","author":"Doshi Nishant","year":"2014"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"A. Erdelyi. Asymptotic Expansions. Dover 1956.  A. Erdelyi. Asymptotic Expansions. Dover 1956.","DOI":"10.21236\/AD0055660"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0403019"},{"key":"e_1_3_2_1_12_1","volume-title":"Cambridge University Press","author":"Flajolet Philippe","year":"2009"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/512529.512558"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.106988"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/263699.263717"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065036"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_35"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1543135.1542518"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328468"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1809028.1806630"},{"issue":"1","key":"e_1_3_2_1_21_1","article-title":"Cyclomatic complexity: theme and variations","volume":"1","author":"Henderson-Sellers Brian","year":"1993","journal-title":"Australasian J. of Inf. Systems"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1987.233164"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.46879"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/360248.360252"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1588-2"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594331"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1976.233837"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0164-1212(92)90116-2"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/42372.42379"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10515-013-0122-2"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081706.1081750"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/2124415"},{"key":"e_1_3_2_1_33_1","volume-title":"Galois Theory","author":"Stewart I.","year":"2003"},{"key":"e_1_3_2_1_34_1","volume-title":"Cengage Learning","author":"Stewart J.","year":"2007"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022920129859"},{"key":"e_1_3_2_1_36_1","unstructured":"Introduction Overview Computing Path Complexity Comparison with Other Complexity Measures Implementation & Experiments Conclusions Replication Package References  Introduction Overview Computing Path Complexity Comparison with Other Complexity Measures Implementation & Experiments Conclusions Replication Package References"}],"event":{"name":"ESEC\/FSE'15: Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering","location":"Bergamo Italy","acronym":"ESEC\/FSE'15","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering"]},"container-title":["Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2786805.2786863","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2786805.2786863","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:21Z","timestamp":1750227381000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2786805.2786863"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,30]]},"references-count":36,"alternative-id":["10.1145\/2786805.2786863","10.1145\/2786805"],"URL":"https:\/\/doi.org\/10.1145\/2786805.2786863","relation":{},"subject":[],"published":{"date-parts":[[2015,8,30]]},"assertion":[{"value":"2015-08-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}