{"id":"https://openalex.org/W1966032455","doi":"https://doi.org/10.1145/2491956.2462159","title":"Fast algorithms for Dyck-CFL-reachability with applications to alias analysis","display_name":"Fast algorithms for Dyck-CFL-reachability with applications to alias analysis","publication_year":2013,"publication_date":"2013-06-11","ids":{"openalex":"https://openalex.org/W1966032455","doi":"https://doi.org/10.1145/2491956.2462159","mag":"1966032455"},"language":"en","primary_location":{"id":"doi:10.1145/2491956.2462159","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2491956.2462159","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation","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/A5078231842","display_name":"Qirun Zhang","orcid":"https://orcid.org/0000-0001-5367-9377"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Qirun Zhang","raw_affiliation_strings":["The Chinese University of Hong Kong, Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069596903","display_name":"Michael R. Lyu","orcid":"https://orcid.org/0000-0002-3666-5798"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Michael R. Lyu","raw_affiliation_strings":["The Chinese University of Hong Kong, Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100619853","display_name":"Hao Yuan","orcid":"https://orcid.org/0000-0002-9416-2929"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hao Yuan","raw_affiliation_strings":["BOPU Technologies, Shen Zhen, China"],"affiliations":[{"raw_affiliation_string":"BOPU Technologies, Shen Zhen, China","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077610917","display_name":"Zhendong Su","orcid":"https://orcid.org/0000-0002-2970-1391"},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhendong Su","raw_affiliation_strings":["University of California, Davis, Davis, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of California, Davis, Davis, CA, USA","institution_ids":["https://openalex.org/I84218800"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5078231842"],"corresponding_institution_ids":["https://openalex.org/I177725633"],"apc_list":null,"apc_paid":null,"fwci":7.775,"has_fulltext":false,"cited_by_count":65,"citation_normalized_percentile":{"value":0.97242206,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"435","last_page":"446"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10260","display_name":"Software Engineering Research","score":0.9983000159263611,"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/T11241","display_name":"Advanced Malware Detection Techniques","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/reachability","display_name":"Reachability","score":0.8927661180496216},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5549538135528564},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5120830535888672},{"id":"https://openalex.org/keywords/alias","display_name":"Alias","score":0.4561762511730194},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3855743706226349},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3854040503501892},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37569329142570496},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34886348247528076}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8927661180496216},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5549538135528564},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5120830535888672},{"id":"https://openalex.org/C46681722","wikidata":"https://www.wikidata.org/wiki/Q4725589","display_name":"Alias","level":2,"score":0.4561762511730194},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3855743706226349},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3854040503501892},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37569329142570496},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34886348247528076},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2491956.2462159","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2491956.2462159","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.308.8110","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.308.8110","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ucdavis.edu/~su/publications/pldi13.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.828.1679","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.828.1679","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.cuhk.edu.hk/lyu/_media/paper/pldi2013.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W1507039213","https://openalex.org/W1507046749","https://openalex.org/W1534545952","https://openalex.org/W1536265389","https://openalex.org/W1829276407","https://openalex.org/W1971782746","https://openalex.org/W1980468060","https://openalex.org/W1981904441","https://openalex.org/W1990051509","https://openalex.org/W1990053053","https://openalex.org/W1990810662","https://openalex.org/W2002771912","https://openalex.org/W2024779397","https://openalex.org/W2030166143","https://openalex.org/W2045238089","https://openalex.org/W2046699259","https://openalex.org/W2050320220","https://openalex.org/W2055084740","https://openalex.org/W2064982280","https://openalex.org/W2065088439","https://openalex.org/W2069476565","https://openalex.org/W2079752311","https://openalex.org/W2080573945","https://openalex.org/W2088140535","https://openalex.org/W2092483417","https://openalex.org/W2093080079","https://openalex.org/W2103714221","https://openalex.org/W2108769896","https://openalex.org/W2110833886","https://openalex.org/W2112936713","https://openalex.org/W2119137801","https://openalex.org/W2133497528","https://openalex.org/W2135565307","https://openalex.org/W2151033407","https://openalex.org/W2151670874","https://openalex.org/W2153578567","https://openalex.org/W2158600037","https://openalex.org/W2167363133","https://openalex.org/W2169304846","https://openalex.org/W3145128584","https://openalex.org/W4235915479","https://openalex.org/W4243644740","https://openalex.org/W4246219036"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2127267268","https://openalex.org/W4385605198","https://openalex.org/W2136512912","https://openalex.org/W2772294324","https://openalex.org/W4253760428","https://openalex.org/W2047831585","https://openalex.org/W3082487952","https://openalex.org/W3040348990","https://openalex.org/W4288357225"],"abstract_inverted_index":{"The":[0],"context-free":[1],"language":[2,69],"(CFL)":[3],"reachability":[4],"problem":[5],"is":[6,43],"a":[7,23,46,62,138],"well-known":[8],"fundamental":[9],"formulation":[10],"in":[11],"program":[12,17],"analysis.":[13],"In":[14,108],"practice,":[15],"many":[16],"analyses,":[18,21],"especially":[19],"pointer":[20],"adopt":[22],"restricted":[24,80],"version":[25],"of":[26,73,154],"CFL-reachability,":[27],"Dyck-CFL-reachability,":[28],"and":[29,52,106,117,127,133,157],"compute":[30],"on":[31,39,103,125,137,145],"edge-labeled":[32],"bidirected":[33,41,47,82,104],"graphs.":[34,107],"Solving":[35],"the":[36,55,67,76,100],"all-pairs":[37],"Dyck-CFL-reachability":[38,101],"such":[40],"graphs":[42,78,128],"expensive.":[44],"For":[45],"graph":[48],"with":[49,70,86,115],"n":[50,89],"nodes":[51],"m":[53,120],"edges,":[54],"traditional":[56],"dynamic":[57],"programming":[58],"style":[59],"algorithm":[60,85],"exhibits":[61],"subcubic":[63],"time":[64,92,123],"complexity":[65,93],"for":[66,142],"Dyck":[68],"k":[71],"kinds":[72],"parentheses.":[74],"When":[75],"underlying":[77],"are":[79],"to":[81],"trees,":[83],"an":[84],"O(n":[87,118],"log":[88,90,121],"k)":[91],"was":[94],"proposed":[95],"recently.":[96],"This":[97],"paper":[98],"studies":[99],"problems":[102],"trees":[105,126],"particular,":[109],"it":[110],"presents":[111],"two":[112],"fast":[113],"algorithms":[114,136,151],"O(n)":[116],"+":[119],"m)":[122],"complexities":[124],"respectively.":[129],"We":[130],"have":[131],"implemented":[132],"evaluated":[134],"our":[135,150],"state-of-the-art":[139],"alias":[140],"analysis":[141],"Java.":[143],"Results":[144],"standard":[146],"benchmarks":[147],"show":[148],"that":[149],"achieve":[152],"orders":[153],"magnitude":[155],"speedup":[156],"consume":[158],"less":[159],"memory.":[160]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-11T08:14:18.477133","created_date":"2025-10-10T00:00:00"}
