{"id":"https://openalex.org/W4382655642","doi":"https://doi.org/10.1109/formalise58978.2023.00016","title":"Formalizing Path Explosion for Recursive Functions via Asymptotic Path Complexity","display_name":"Formalizing Path Explosion for Recursive Functions via Asymptotic Path Complexity","publication_year":2023,"publication_date":"2023-05-01","ids":{"openalex":"https://openalex.org/W4382655642","doi":"https://doi.org/10.1109/formalise58978.2023.00016"},"language":"en","primary_location":{"id":"doi:10.1109/formalise58978.2023.00016","is_oa":false,"landing_page_url":"https://doi.org/10.1109/formalise58978.2023.00016","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE/ACM 11th International Conference on Formal Methods in Software Engineering (FormaliSE)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5092365952","display_name":"Eli Pregerson","orcid":null},"institutions":[{"id":"https://openalex.org/I133543626","display_name":"Harvey Mudd College","ror":"https://ror.org/025ecfn45","country_code":"US","type":"education","lineage":["https://openalex.org/I133543626"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eli Pregerson","raw_affiliation_strings":["Harvey Mudd College,Computer Science Department,Claremont,California,USA","Computer Science Department, Harvey Mudd College, Claremont, California, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harvey Mudd College,Computer Science Department,Claremont,California,USA","institution_ids":["https://openalex.org/I133543626"]},{"raw_affiliation_string":"Computer Science Department, Harvey Mudd College, Claremont, California, USA","institution_ids":["https://openalex.org/I133543626"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008714283","display_name":"Shaheen Cullen-Baratloo","orcid":null},"institutions":[{"id":"https://openalex.org/I133543626","display_name":"Harvey Mudd College","ror":"https://ror.org/025ecfn45","country_code":"US","type":"education","lineage":["https://openalex.org/I133543626"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shaheen Cullen-Baratloo","raw_affiliation_strings":["Harvey Mudd College,Computer Science Department,Claremont,California,USA","Computer Science Department, Harvey Mudd College, Claremont, California, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harvey Mudd College,Computer Science Department,Claremont,California,USA","institution_ids":["https://openalex.org/I133543626"]},{"raw_affiliation_string":"Computer Science Department, Harvey Mudd College, Claremont, California, USA","institution_ids":["https://openalex.org/I133543626"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102867584","display_name":"David L. Chen","orcid":"https://orcid.org/0009-0009-1111-8366"},"institutions":[{"id":"https://openalex.org/I133543626","display_name":"Harvey Mudd College","ror":"https://ror.org/025ecfn45","country_code":"US","type":"education","lineage":["https://openalex.org/I133543626"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Chen","raw_affiliation_strings":["Harvey Mudd College,Computer Science Department,Claremont,California,USA","Computer Science Department, Harvey Mudd College, Claremont, California, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harvey Mudd College,Computer Science Department,Claremont,California,USA","institution_ids":["https://openalex.org/I133543626"]},{"raw_affiliation_string":"Computer Science Department, Harvey Mudd College, Claremont, California, USA","institution_ids":["https://openalex.org/I133543626"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103105654","display_name":"Duy Lam","orcid":"https://orcid.org/0009-0009-8690-0117"},"institutions":[{"id":"https://openalex.org/I133543626","display_name":"Harvey Mudd College","ror":"https://ror.org/025ecfn45","country_code":"US","type":"education","lineage":["https://openalex.org/I133543626"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Duy Lam","raw_affiliation_strings":["Harvey Mudd College,Computer Science Department,Claremont,California,USA","Computer Science Department, Harvey Mudd College, Claremont, California, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harvey Mudd College,Computer Science Department,Claremont,California,USA","institution_ids":["https://openalex.org/I133543626"]},{"raw_affiliation_string":"Computer Science Department, Harvey Mudd College, Claremont, California, USA","institution_ids":["https://openalex.org/I133543626"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5092365953","display_name":"Max Szostak","orcid":null},"institutions":[{"id":"https://openalex.org/I133543626","display_name":"Harvey Mudd College","ror":"https://ror.org/025ecfn45","country_code":"US","type":"education","lineage":["https://openalex.org/I133543626"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Max Szostak","raw_affiliation_strings":["Harvey Mudd College,Computer Science Department,Claremont,California,USA","Computer Science Department, Harvey Mudd College, Claremont, California, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harvey Mudd College,Computer Science Department,Claremont,California,USA","institution_ids":["https://openalex.org/I133543626"]},{"raw_affiliation_string":"Computer Science Department, Harvey Mudd College, Claremont, California, USA","institution_ids":["https://openalex.org/I133543626"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061187880","display_name":"Lucas Bang","orcid":"https://orcid.org/0000-0003-2711-5548"},"institutions":[{"id":"https://openalex.org/I133543626","display_name":"Harvey Mudd College","ror":"https://ror.org/025ecfn45","country_code":"US","type":"education","lineage":["https://openalex.org/I133543626"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lucas Bang","raw_affiliation_strings":["Harvey Mudd College,Computer Science Department,Claremont,California,USA","Computer Science Department, Harvey Mudd College, Claremont, California, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harvey Mudd College,Computer Science Department,Claremont,California,USA","institution_ids":["https://openalex.org/I133543626"]},{"raw_affiliation_string":"Computer Science Department, Harvey Mudd College, Claremont, California, USA","institution_ids":["https://openalex.org/I133543626"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I133543626"],"apc_list":null,"apc_paid":null,"fwci":0.6479,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.65909573,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"76","last_page":"85"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10260","display_name":"Software Engineering Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10260","display_name":"Software Engineering Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12423","display_name":"Software Reliability and Analysis Research","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6602681875228882},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.655538022518158},{"id":"https://openalex.org/keywords/symbolic-execution","display_name":"Symbolic execution","score":0.5114170908927917},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5044370889663696},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.475685715675354},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4415241479873657},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4274212419986725},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.4175906181335449},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4047725796699524},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.3440077304840088},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2676670253276825},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.09795701503753662}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6602681875228882},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.655538022518158},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.5114170908927917},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5044370889663696},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.475685715675354},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4415241479873657},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4274212419986725},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4175906181335449},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4047725796699524},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.3440077304840088},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2676670253276825},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.09795701503753662},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/formalise58978.2023.00016","is_oa":false,"landing_page_url":"https://doi.org/10.1109/formalise58978.2023.00016","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE/ACM 11th International Conference on Formal Methods in Software Engineering (FormaliSE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W186403072","https://openalex.org/W1964962870","https://openalex.org/W2045176168","https://openalex.org/W2095357205","https://openalex.org/W2101728371","https://openalex.org/W2147976636","https://openalex.org/W2884453255","https://openalex.org/W2918466505","https://openalex.org/W2952100912","https://openalex.org/W3103744781","https://openalex.org/W3163095639","https://openalex.org/W3163497412","https://openalex.org/W4235761353","https://openalex.org/W4297878330","https://openalex.org/W6764773628"],"related_works":["https://openalex.org/W1482441085","https://openalex.org/W2966858528","https://openalex.org/W2151687600","https://openalex.org/W2132921321","https://openalex.org/W2912813468","https://openalex.org/W2065006817","https://openalex.org/W2129550502","https://openalex.org/W2116465486","https://openalex.org/W2101572961","https://openalex.org/W1995629993"],"abstract_inverted_index":{"Path":[0,27],"coverage":[1],"is":[2,14,30,103,146],"of":[3,40,48,109,118,132,155,158,165,207],"critical":[4],"importance":[5],"in":[6,65,136,193],"software":[7,20],"testing":[8],"and":[9,43,74,125,202],"verification.":[10],"Furthermore,":[11],"path":[12,41,50,62,92,188],"explosion":[13,42,63,189],"a":[15,31,86,130,147,163],"well-known":[16],"challenge":[17],"for":[18,81,89,94,190,209],"automatic":[19],"analysis":[21,122],"techniques":[22],"like":[23],"symbolic":[24,175,186],"execution.":[25],"Asymptotic":[26],"Complexity":[28],"(APC)":[29],"code":[32,120],"complexity":[33,93,121],"metric":[34],"that":[35,144],"formalizes":[36],"the":[37,46,61,106,119,137,152,156,173,196,205],"quantitative":[38],"measurement":[39],"therefore":[44],"measures":[45],"difficulty":[47],"achieving":[49],"coverage.":[51],"Prior":[52],"APC":[53,80,198,208,222],"methods":[54],"were":[55,75],"not":[56],"sufficiently":[57],"expressive":[58],"to":[59,77],"model":[60],"behavior":[64],"recursive":[66,72,82,95,191],"functions.":[67,83],"Existing":[68],"analyses":[69],"simply":[70],"ignored":[71],"calls":[73],"unable":[76],"correctly":[78],"compute":[79],"We":[84,112],"present":[85],"novel":[87],"method":[88],"computing":[90],"asymptotic":[91],"functions,":[96],"which":[97],"we":[98],"call":[99],"APC-R.":[100],"Our":[101,141,178],"approach":[102,115],"based":[104],"on":[105,116,129,151,184],"analytic":[107],"combinatorics":[108],"context-free":[110],"grammars.":[111],"implemented":[113],"our":[114,127],"top":[117],"tool":[123],"METRINOME":[124],"evaluated":[126],"implementation":[128,180,199],"set":[131],"benchmark":[133],"programs":[134],"written":[135],"C":[138],"programming":[139],"language.":[140],"experiments":[142],"demonstrate":[143],"APC-R":[145,179,203,219],"sound":[148,182],"upper":[149],"bound":[150],"growth":[153],"rate":[154],"number":[157],"program":[159],"paths":[160],"explored":[161],"as":[162],"function":[164],"increasing":[166],"exploration":[167],"depth":[168],"when":[169],"generating":[170],"tests":[171],"with":[172,212],"KLEE":[174],"execution":[176,187],"engine.":[177],"provides":[181],"bounds":[183],"KLEE\u2019S":[185],"functions":[192,211],"cases":[194],"where":[195],"original":[197],"did":[200],"not,":[201],"matches":[204],"results":[206],"non-recursive":[210],"only":[213],"marginal":[214],"computational":[215],"overhead.":[216],"That":[217],"is,":[218],"subsumes":[220],"earlier":[221],"work":[223],"without":[224],"significant":[225],"performance":[226],"cost.":[227]},"counts_by_year":[{"year":2024,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}