{"id":"https://openalex.org/W2777662281","doi":"https://doi.org/10.1145/3158118","title":"Optimal Dyck reachability for data-dependence and alias analysis","display_name":"Optimal Dyck reachability for data-dependence and alias analysis","publication_year":2017,"publication_date":"2017-12-27","ids":{"openalex":"https://openalex.org/W2777662281","doi":"https://doi.org/10.1145/3158118","mag":"2777662281"},"language":"en","primary_location":{"id":"doi:10.1145/3158118","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3158118","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3158118?download=true","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3158118?download=true","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052607806","display_name":"Krishnendu Chatterjee","orcid":"https://orcid.org/0000-0002-4561-241X"},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Krishnendu Chatterjee","raw_affiliation_strings":["IST Austria, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IST Austria, Austria","institution_ids":["https://openalex.org/I157556583"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083476000","display_name":"Bhavya Choudhary","orcid":null},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Bhavya Choudhary","raw_affiliation_strings":["IIT Bombay, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IIT Bombay, India","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022252401","display_name":"Andreas Pavlogiannis","orcid":"https://orcid.org/0000-0002-8943-0722"},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Andreas Pavlogiannis","raw_affiliation_strings":["IST Austria, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IST Austria, Austria","institution_ids":["https://openalex.org/I157556583"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0133,"has_fulltext":true,"cited_by_count":41,"citation_normalized_percentile":{"value":0.88761882,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"2","issue":"POPL","first_page":"1","last_page":"30"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.8645187616348267},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6670030355453491},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6123074293136597},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4900628328323364},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4181002676486969},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.4162929952144623},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.41570937633514404},{"id":"https://openalex.org/keywords/alias","display_name":"Alias","score":0.41011151671409607},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4029768407344818},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3240954279899597}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8645187616348267},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6670030355453491},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6123074293136597},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4900628328323364},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4181002676486969},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.4162929952144623},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.41570937633514404},{"id":"https://openalex.org/C46681722","wikidata":"https://www.wikidata.org/wiki/Q4725589","display_name":"Alias","level":2,"score":0.41011151671409607},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4029768407344818},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3240954279899597},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3158118","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3158118","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3158118?download=true","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/3cef6bb2-3690-4728-bd02-142a06ff1bad","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/da/publications/optimal-dyck-reachability-for-datadependence-and-alias-analysis(3cef6bb2-3690-4728-bd02-142a06ff1bad).html","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"doi:10.1145/3158118","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3158118","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3158118?download=true","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2655136877","display_name":null,"funder_award_id":"S11407","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G683671635","display_name":null,"funder_award_id":"S11407-N23","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G7498447428","display_name":null,"funder_award_id":"P23499- N23, S11407-N23","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G7934954343","display_name":null,"funder_award_id":"279307: Graph Games","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G8326495921","display_name":null,"funder_award_id":"P23499-N23","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2777662281.pdf","grobid_xml":"https://content.openalex.org/works/W2777662281.grobid-xml"},"referenced_works_count":65,"referenced_works":["https://openalex.org/W100599422","https://openalex.org/W216692372","https://openalex.org/W854382448","https://openalex.org/W1507046749","https://openalex.org/W1541012495","https://openalex.org/W1548254758","https://openalex.org/W1557543533","https://openalex.org/W1576925855","https://openalex.org/W1818617877","https://openalex.org/W1821417028","https://openalex.org/W1829276407","https://openalex.org/W1966032455","https://openalex.org/W1971782746","https://openalex.org/W1981904441","https://openalex.org/W1986022261","https://openalex.org/W1986261983","https://openalex.org/W1989351810","https://openalex.org/W1989556004","https://openalex.org/W1990053053","https://openalex.org/W1991755800","https://openalex.org/W1997981086","https://openalex.org/W2002722727","https://openalex.org/W2002771912","https://openalex.org/W2003824261","https://openalex.org/W2016056456","https://openalex.org/W2024779397","https://openalex.org/W2025063099","https://openalex.org/W2028503265","https://openalex.org/W2030166143","https://openalex.org/W2035260626","https://openalex.org/W2035476608","https://openalex.org/W2043555680","https://openalex.org/W2046699259","https://openalex.org/W2050320220","https://openalex.org/W2055084740","https://openalex.org/W2055916047","https://openalex.org/W2071362870","https://openalex.org/W2074131210","https://openalex.org/W2079752311","https://openalex.org/W2080573945","https://openalex.org/W2080696000","https://openalex.org/W2084803275","https://openalex.org/W2087083200","https://openalex.org/W2088140535","https://openalex.org/W2101344335","https://openalex.org/W2105285801","https://openalex.org/W2110833886","https://openalex.org/W2112936713","https://openalex.org/W2119137801","https://openalex.org/W2120248756","https://openalex.org/W2133497528","https://openalex.org/W2143406303","https://openalex.org/W2146507303","https://openalex.org/W2147247482","https://openalex.org/W2153715991","https://openalex.org/W2166091242","https://openalex.org/W2169304846","https://openalex.org/W2170927924","https://openalex.org/W2231883621","https://openalex.org/W2486038297","https://openalex.org/W2528431921","https://openalex.org/W2561266941","https://openalex.org/W2570435792","https://openalex.org/W3145128584","https://openalex.org/W4235915479"],"related_works":["https://openalex.org/W4253760428","https://openalex.org/W2047831585","https://openalex.org/W3208672221","https://openalex.org/W3017277461","https://openalex.org/W4287199681","https://openalex.org/W3172202899","https://openalex.org/W4224983736","https://openalex.org/W2060144422","https://openalex.org/W2011495892","https://openalex.org/W4389158950"],"abstract_inverted_index":{"A":[0],"fundamental":[1],"algorithmic":[2],"problem":[3,191],"at":[4],"the":[5,19,32,90,131,136,176,190,197,208,222,225,228,231,240,283,300,330,339],"heart":[6],"of":[7,26,93,169,192,204,210,224,230,242,306,315],"static":[8],"analysis":[9,56,202,233,321],"is":[10,15,35,89,130,156,199,234,274],"Dyck":[11,49,83,252,288],"reachability.":[12],"The":[13],"input":[14],"a":[16,99,147,275,312],"graph":[17,101],"where":[18,126,196],"edges":[20],"are":[21,41,77,290],"labeled":[22],"with":[23,52,102,113,257],"different":[24],"types":[25],"opening":[27],"and":[28,31,57,105,162,237,322],"closing":[29],"parentheses,":[30],"reachability":[33,50,84,253,289],"information":[34],"computed":[36],"via":[37],"paths":[38],"whose":[39],"parentheses":[40],"properly":[42],"matched.":[43],"We":[44,296],"present":[45],"new":[46,331],"results":[47],"for":[48,251,269,287,293,304,318],"problems":[51],"applications":[53],"to":[54,159,200],"alias":[55,320],"data-dependence":[58,194,323],"analysis.":[59,97,324],"Our":[60,212,325],"main":[61],"contributions,":[62],"that":[63,73,151,153,248,282,299,329],"include":[64],"improved":[65],"upper":[66,167],"bounds":[67,72,260],"as":[68,70,78],"well":[69],"lower":[71,149],"establish":[74,281],"optimality":[75],"guarantees,":[76],"follows:":[79],"First,":[80],"we":[81,108,188,246,280,310],"consider":[82,189],"on":[85,254,338],"bidirected":[86,100],"graphs,":[87],"which":[88,221,273],"standard":[91],"way":[92],"performing":[94],"field-sensitive":[95],"points-to":[96],"Given":[98],"n":[103,121,124,128,141,184],"nodes":[104],"m":[106,119,172,181],"edges,":[107],"present:":[109],"(i)":[110],"an":[111,164],"algorithm":[112,155,213],"worst-case":[114,160],"running":[115],"time":[116,144],"O":[117,139,170,179],"(":[118,140,171,180],"+":[120],"\u00b7":[122,182],"\u03b1(":[123,127],")),":[125],")":[129,143,173,185],"inverse":[132],"Ackermann":[133],"function,":[134],"improving":[135,175],"previously":[137,177],"known":[138,178],"2":[142],"bound;":[145],"(ii)":[146],"matching":[148],"bound":[150,168],"shows":[152],"our":[154,316],"optimal":[157,165,292],"wrt":[158,239],"complexity;":[161],"(iii)":[163],"average-case":[166],"time,":[174,219],"log":[183],"bound.":[186],"Second,":[187],"context-sensitive":[193],"analysis,":[195],"task":[198],"obtain":[201],"summaries":[203],"library":[205,226],"code":[206],"in":[207,216,227],"presence":[209],"callbacks.":[211],"preprocesses":[214],"libraries":[215],"almost":[217],"linear":[218],"after":[220],"contribution":[223],"complexity":[229],"client":[232],"only":[235,238],"linear,":[236],"number":[241],"call":[243],"sites.":[244],"Third,":[245],"prove":[247],"combinatorial":[249,267,285],"algorithms":[250,268,286,317,332],"general":[255,294],"graphs":[256,305],"truly":[258],"sub-cubic":[259,266],"cannot":[261],"be":[262],"obtained":[263],"without":[264],"obtaining":[265],"Boolean":[270],"Matrix":[271],"Multiplication,":[272],"long-standing":[276],"open":[277],"problem.":[278],"Thus":[279],"existing":[284,336],"(conditionally)":[291],"graphs.":[295],"also":[297],"show":[298],"same":[301],"hardness":[302],"holds":[303],"constant":[307],"treewidth.":[308],"Finally,":[309],"provide":[311],"prototype":[313],"implementation":[314],"both":[319],"experimental":[326],"evaluation":[327],"demonstrates":[328],"significantly":[333],"outperform":[334],"all":[335],"methods":[337],"two":[340],"problems,":[341],"over":[342],"real-world":[343],"benchmarks.":[344]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}