{"id":"https://openalex.org/W2045176168","doi":"https://doi.org/10.1145/2786805.2786863","title":"Automatically computing path complexity of programs","display_name":"Automatically computing path complexity of programs","publication_year":2015,"publication_date":"2015-08-26","ids":{"openalex":"https://openalex.org/W2045176168","doi":"https://doi.org/10.1145/2786805.2786863","mag":"2045176168"},"language":"en","primary_location":{"id":"doi:10.1145/2786805.2786863","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2786805.2786863","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering","raw_type":"proceedings-article"},"type":"article","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/A5061187880","display_name":"Lucas Bang","orcid":"https://orcid.org/0000-0003-2711-5548"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Lucas Bang","raw_affiliation_strings":["University of California at Santa Barbara, USA","University of California at, Santa Barbara, USA"],"affiliations":[{"raw_affiliation_string":"University of California at Santa Barbara, USA","institution_ids":["https://openalex.org/I154570441"]},{"raw_affiliation_string":"University of California at, Santa Barbara, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064839223","display_name":"Abdulbaki Aydin","orcid":null},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Abdulbaki Aydin","raw_affiliation_strings":["University of California at Santa Barbara, USA","University of California at, Santa Barbara, USA"],"affiliations":[{"raw_affiliation_string":"University of California at Santa Barbara, USA","institution_ids":["https://openalex.org/I154570441"]},{"raw_affiliation_string":"University of California at, Santa Barbara, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039991493","display_name":"Tevfik Bultan","orcid":"https://orcid.org/0000-0003-2993-1215"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tevfik Bultan","raw_affiliation_strings":["University of California at Santa Barbara, USA","University of California at, Santa Barbara, USA"],"affiliations":[{"raw_affiliation_string":"University of California at Santa Barbara, USA","institution_ids":["https://openalex.org/I154570441"]},{"raw_affiliation_string":"University of California at, Santa Barbara, USA","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5061187880"],"corresponding_institution_ids":["https://openalex.org/I154570441"],"apc_list":null,"apc_paid":null,"fwci":2.2228,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.87490359,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"61","last_page":"72"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":1.0,"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/T10260","display_name":"Software Engineering Research","score":0.9993000030517578,"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/T12423","display_name":"Software Reliability and Analysis Research","score":0.9991999864578247,"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/cyclomatic-complexity","display_name":"Cyclomatic complexity","score":0.8227201700210571},{"id":"https://openalex.org/keywords/worst-case-complexity","display_name":"Worst-case complexity","score":0.7288234829902649},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.7082807421684265},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6434714794158936},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5810558795928955},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.5571594834327698},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.546381950378418},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4776631295681},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.47117382287979126},{"id":"https://openalex.org/keywords/control-flow-graph","display_name":"Control flow graph","score":0.46338117122650146},{"id":"https://openalex.org/keywords/path-expression","display_name":"Path expression","score":0.45940011739730835},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4344959855079651},{"id":"https://openalex.org/keywords/average-case-complexity","display_name":"Average-case complexity","score":0.4297560751438141},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.4253283143043518},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.42355817556381226},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42320799827575684},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3985676169395447},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30768460035324097},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.24357512593269348},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.2390120029449463},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.1130150556564331}],"concepts":[{"id":"https://openalex.org/C187303228","wikidata":"https://www.wikidata.org/wiki/Q867330","display_name":"Cyclomatic complexity","level":3,"score":0.8227201700210571},{"id":"https://openalex.org/C96563100","wikidata":"https://www.wikidata.org/wiki/Q8037118","display_name":"Worst-case complexity","level":3,"score":0.7288234829902649},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7082807421684265},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6434714794158936},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5810558795928955},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.5571594834327698},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.546381950378418},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4776631295681},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.47117382287979126},{"id":"https://openalex.org/C27458966","wikidata":"https://www.wikidata.org/wiki/Q1187693","display_name":"Control flow graph","level":2,"score":0.46338117122650146},{"id":"https://openalex.org/C61114434","wikidata":"https://www.wikidata.org/wiki/Q7144649","display_name":"Path expression","level":3,"score":0.45940011739730835},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4344959855079651},{"id":"https://openalex.org/C24604422","wikidata":"https://www.wikidata.org/wiki/Q4828244","display_name":"Average-case complexity","level":3,"score":0.4297560751438141},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.4253283143043518},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.42355817556381226},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42320799827575684},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3985676169395447},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30768460035324097},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.24357512593269348},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.2390120029449463},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.1130150556564331},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2786805.2786863","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2786805.2786863","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.725.5211","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.725.5211","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ucsb.edu/%7Ebaki/publications/fse15.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1618543994","display_name":null,"funder_award_id":"FA8750-15-2-0087","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G3172429894","display_name":null,"funder_award_id":"CCF-1423623","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W1023119160","https://openalex.org/W1492171827","https://openalex.org/W1497388113","https://openalex.org/W1505646570","https://openalex.org/W1534557881","https://openalex.org/W1579213680","https://openalex.org/W1586233811","https://openalex.org/W1710734607","https://openalex.org/W1964962870","https://openalex.org/W1993836075","https://openalex.org/W2009489720","https://openalex.org/W2018912833","https://openalex.org/W2018919817","https://openalex.org/W2024442685","https://openalex.org/W2038997378","https://openalex.org/W2057602726","https://openalex.org/W2065675749","https://openalex.org/W2078988604","https://openalex.org/W2096449544","https://openalex.org/W2101512909","https://openalex.org/W2122917953","https://openalex.org/W2130060711","https://openalex.org/W2132251441","https://openalex.org/W2146641295","https://openalex.org/W2148423957","https://openalex.org/W2159756689","https://openalex.org/W2170555940","https://openalex.org/W2171480813","https://openalex.org/W2340541605","https://openalex.org/W2479778494","https://openalex.org/W2898916015","https://openalex.org/W2918466505","https://openalex.org/W3009765366","https://openalex.org/W3136358674","https://openalex.org/W4237492309","https://openalex.org/W4247006273","https://openalex.org/W4247080677"],"related_works":["https://openalex.org/W2081026687","https://openalex.org/W2047288939","https://openalex.org/W1969215739","https://openalex.org/W1759713541","https://openalex.org/W3145586138","https://openalex.org/W1489208005","https://openalex.org/W3008482400","https://openalex.org/W2496940404","https://openalex.org/W2559889423","https://openalex.org/W2045176168"],"abstract_inverted_index":{"Recent":[0],"automated":[1],"software":[2],"testing":[3],"techniques":[4],"concentrate":[5],"on":[6],"achieving":[7,38],"path":[8,39,48,86,95,104,111,125],"coverage.":[9],"We":[10,45,79],"present":[11],"a":[12,26,42,51,54,58,120],"complexity":[13,49,87,96,105,112,122,130],"measure":[14,123],"that":[15,56,74,77,110],"provides":[16],"an":[17],"upper":[18],"bound":[19,60],"for":[20,33,41,124],"the":[21,35,47,65,70,85,93,99,103],"number":[22,66],"of":[23,37,50,67],"paths":[24,68],"in":[25,69,89,102],"program,":[27],"and":[28,63,92,117,131],"hence,":[29],"can":[30,113],"be":[31,114],"used":[32],"assessing":[34],"difficulty":[36],"coverage":[40,126],"given":[43],"method.":[44],"define":[46],"program":[52],"as":[53,61],"function":[55,88],"takes":[57],"depth":[59],"input":[62],"returns":[64],"control":[71],"flow":[72],"graph":[73],"are":[75],"within":[76],"bound.":[78],"show":[80],"how":[81],"to":[82,128],"automatically":[83],"compute":[84],"closed":[90],"form,":[91],"asymptotic":[94],"which":[97],"identifies":[98],"dominant":[100],"term":[101],"function.":[106],"Our":[107],"results":[108],"demonstrate":[109],"computed":[115],"efficiently,":[116],"it":[118],"is":[119],"better":[121],"compared":[127],"cyclomatic":[129],"NPATH":[132],"complexity.":[133]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}