{"id":"https://openalex.org/W4406222188","doi":"https://doi.org/10.1145/3704854","title":"Program Analysis via Multiple Context Free Language Reachability","display_name":"Program Analysis via Multiple Context Free Language Reachability","publication_year":2025,"publication_date":"2025-01-07","ids":{"openalex":"https://openalex.org/W4406222188","doi":"https://doi.org/10.1145/3704854"},"language":"en","primary_location":{"id":"doi:10.1145/3704854","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3704854","pdf_url":null,"source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"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":"diamond","oa_url":"https://doi.org/10.1145/3704854","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056272945","display_name":"Giovanna Kobus Conrado","orcid":"https://orcid.org/0000-0001-9474-6505"},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"Giovanna Kobus Conrado","raw_affiliation_strings":["Hong Kong University of Science and Technology, Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Hong Kong University of Science and Technology, Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I200769079"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078541668","display_name":"Adam Husted Kjelstr\u00f8m","orcid":"https://orcid.org/0000-0002-1275-9933"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Adam Husted Kjelstr\u00f8m","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012697499","display_name":"Jaco van de Pol","orcid":"https://orcid.org/0000-0003-4305-0625"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Jaco van de Pol","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"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/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Andreas Pavlogiannis","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5056272945"],"corresponding_institution_ids":["https://openalex.org/I200769079"],"apc_list":null,"apc_paid":null,"fwci":2.1689,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.8224166,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":"9","issue":"POPL","first_page":"509","last_page":"538"},"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.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"}},"topics":[{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","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"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9925000071525574,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.8690166473388672},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6650441884994507},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5799840688705444},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4685816466808319},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24562466144561768},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.1040031909942627}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8690166473388672},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6650441884994507},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5799840688705444},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4685816466808319},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24562466144561768},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.1040031909942627},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3704854","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3704854","pdf_url":null,"source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"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:repository.hkust.edu.hk:1783.1-147623","is_oa":false,"landing_page_url":"http://repository.hkust.edu.hk/ir/Record/1783.1-147623","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"pmh:oai:pure.atira.dk:openaire/adda34b0-4bfc-45fa-ad7a-7b7f0f228ae4","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/adda34b0-4bfc-45fa-ad7a-7b7f0f228ae4","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Conrado, G K, Kjelstr\u00f8m, A H, Van De Pol, J & Pavlogiannis, A 2025, 'Program Analysis via Multiple Context Free Language Reachability', Proceedings of the ACM on Programming Languages , vol. 9, 18. https://doi.org/10.1145/3704854","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/adda34b0-4bfc-45fa-ad7a-7b7f0f228ae4","is_oa":true,"landing_page_url":"https://www.scopus.com/pages/publications/85215367393","pdf_url":null,"source":{"id":"https://openalex.org/S4306400063","display_name":"Scopus (Elsevier)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Conrado, G K, Kjelstr\u00f8m, A H, Van De Pol, J & Pavlogiannis, A 2025, 'Program Analysis via Multiple Context Free Language Reachability', Proceedings of the ACM on Programming Languages , vol. 9, 18. https://doi.org/10.1145/3704854","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1145/3704854","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3704854","pdf_url":null,"source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"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/G8932987692","display_name":null,"funder_award_id":"VIL4211","funder_id":"https://openalex.org/F4320310490","funder_display_name":"Villum Fonden"}],"funders":[{"id":"https://openalex.org/F4320310490","display_name":"Villum Fonden","ror":"https://ror.org/007ww2d15"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":50,"referenced_works":["https://openalex.org/W170821114","https://openalex.org/W1493367105","https://openalex.org/W1507046749","https://openalex.org/W1557543533","https://openalex.org/W1997981086","https://openalex.org/W2008626182","https://openalex.org/W2020396134","https://openalex.org/W2030166143","https://openalex.org/W2031507118","https://openalex.org/W2077007047","https://openalex.org/W2080573945","https://openalex.org/W2084732238","https://openalex.org/W2089385274","https://openalex.org/W2094716892","https://openalex.org/W2100532597","https://openalex.org/W2105285801","https://openalex.org/W2107398710","https://openalex.org/W2119137801","https://openalex.org/W2121924470","https://openalex.org/W2134875273","https://openalex.org/W2151670874","https://openalex.org/W2165546792","https://openalex.org/W2276682279","https://openalex.org/W2331409830","https://openalex.org/W2582151179","https://openalex.org/W2596236679","https://openalex.org/W2777662281","https://openalex.org/W2892948282","https://openalex.org/W2900044545","https://openalex.org/W2965450052","https://openalex.org/W2972926935","https://openalex.org/W2980018082","https://openalex.org/W2989189770","https://openalex.org/W2997088857","https://openalex.org/W3009945260","https://openalex.org/W3033694951","https://openalex.org/W3107612736","https://openalex.org/W3117677213","https://openalex.org/W3126200532","https://openalex.org/W3158908103","https://openalex.org/W4205381966","https://openalex.org/W4206770190","https://openalex.org/W4225134668","https://openalex.org/W4243644740","https://openalex.org/W4315605893","https://openalex.org/W4315606093","https://openalex.org/W4319310895","https://openalex.org/W4387885479","https://openalex.org/W4399850689","https://openalex.org/W6893000605"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2127267268","https://openalex.org/W2136512912","https://openalex.org/W2067910792","https://openalex.org/W2156446763","https://openalex.org/W2143461633","https://openalex.org/W2150194458","https://openalex.org/W4321471459"],"abstract_inverted_index":{"Context-free":[0],"language":[1,37],"(CFL)":[2],"reachability":[3,38,86,108,174,212,347],"is":[4,16,33],"a":[5,18,36,41,49,131,139,177,186,244,322,359],"standard":[6],"approach":[7],"in":[8,80],"static":[9,97,116,190],"analyses,":[10],"where":[11],"the":[12,61,69,81,84,170,194,219,317,341,375],"analysis":[13,66,166,191],"question":[14,201],"(e.g.,":[15],"there":[17,91],"dataflow":[19],"from":[20],"<mml:math":[21,27,43,51,133,141,148,154,222,247,254,265,291,306,326,349,363],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[22,28,44,52,134,142,149,155,223,248,255,266,292,307,327,350,364],"display=\"inline\">":[23,29,45,53,135,143,150,156,224,249,256,267,293,308,328,351,365],"<mml:mi>x</mml:mi>":[24],"</mml:math>":[25,31,47,56,137,145,152,158,241,251,262,288,299,314,338,357,372],"to":[26,203],"<mml:mi>y</mml:mi>":[30],"?)":[32],"phrased":[34],"as":[35,109],"problem":[39,87,220,320],"on":[40,243,340,374],"graph":[42,245],"<mml:mi>G</mml:mi>":[46],"wrt":[48],"CFL":[50],"<mml:mi":[54],"mathvariant=\"bold-script\">L</mml:mi>":[55],".":[57,146,300],"However,":[58],"CFLs":[59],"lack":[60],"expressiveness":[62,196],"needed":[63],"for":[64,74,96,115,348,382],"high":[65],"precision.":[67,167],"On":[68],"other":[70],"hand,":[71],"common":[72,187],"formalisms":[73],"context-sensitive":[75,93],"languages":[76,128],"are":[77],"too":[78],"expressive,":[79],"sense":[82],"that":[83,181,218,304],"corresponding":[85],"becomes":[88],"undecidable.":[89],"Are":[90],"useful":[92],"language-reachability":[94],"models":[95],"analysis?":[98],"In":[99],"this":[100],"paper,":[101],"we":[102,302],"introduce":[103],"Multiple":[104],"Context-Free":[105],"Language":[106],"(MCFL)":[107],"an":[110,121],"expressive":[111,162],"yet":[112],"tractable":[113],"model":[114],"program":[117],"analysis.":[118],"MCFLs":[119,180],"form":[120],"infinite":[122],"hierarchy":[123],"of":[124,172,179,197,246,325,362],"mildly":[125],"context":[126],"sensitive":[127],"parameterized":[129],"by":[130,175],"dimension":[132],"<mml:mi>d</mml:mi>":[136,151,233,275,334,353],"and":[138,153,264],"rank":[140],"<mml:mi>r</mml:mi>":[144,157,258,278,295,310],"Larger":[147],"yield":[159],"progressively":[160],"more":[161],"MCFLs,":[163,198],"offering":[164],"tunable":[165],"We":[168,216],"showcase":[169],"utility":[171],"MCFL":[173,211],"developing":[176],"family":[178],"approximate":[182],"interleaved":[183],"Dyck":[184],"reachability,":[185],"but":[188],"undecidable":[189],"problem.":[192],"Given":[193],"increased":[195],"one":[199],"natural":[200],"pertains":[202],"their":[204],"algorithmic":[205],"complexity,":[206],"i.e.,":[207],"how":[208],"fast":[209],"can":[210],"be":[213],"computed":[214],"?":[215],"show":[217,303],"takes":[221],"<mml:mrow>":[225,228,231,257,268,271,274,277,294,309,329,332,352,366],"<mml:mi>O</mml:mi>":[226,269],"<mml:mfenced>":[227,270,276],"<mml:msup>":[229,272,330,367],"<mml:mi>n</mml:mi>":[230,250,273,331,368],"<mml:mn>2</mml:mn>":[232,333],"<mml:mo>+</mml:mo>":[234,279],"<mml:mn>1</mml:mn>":[235,260,280,297,312,355],"</mml:mrow>":[236,238,240,261,281,283,285,287,298,313,335,337,356,371],"</mml:msup>":[237,284,336,370],"</mml:mfenced>":[239,282,286],"time":[242,289],"nodes":[252],"when":[253,290,305],"<mml:mo>=</mml:mo>":[259,311,354],",":[263,315],"<mml:mo>&gt;</mml:mo>":[296],"Moreover,":[301],"even":[316],"simpler":[318],"membership":[319],"has":[321,358],"lower":[323,360],"bound":[324,361],"based":[339,373],"Strong":[342],"Exponential":[343],"Time":[344],"Hypothesis,":[345],"while":[346],"<mml:mn>3</mml:mn>":[369],"combinatorial":[376],"Boolean":[377],"Matrix":[378],"Multiplication":[379],"Hypothesis.":[380],"Thus,":[381]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-04-15T08:11:43.952461","created_date":"2025-10-10T00:00:00"}
