{"id":"https://openalex.org/W7119519987","doi":"https://doi.org/10.1145/3776716","title":"Bounded Treewidth, Multiple Context-Free Grammars, and Downward Closures","display_name":"Bounded Treewidth, Multiple Context-Free Grammars, and Downward Closures","publication_year":2026,"publication_date":"2026-01-08","ids":{"openalex":"https://openalex.org/W7119519987","doi":"https://doi.org/10.1145/3776716"},"language":"en","primary_location":{"id":"doi:10.1145/3776716","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3776716","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":null,"license_id":null,"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/3776716","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5122328321","display_name":"C. Aiswarya","orcid":null},"institutions":[{"id":"https://openalex.org/I19149307","display_name":"Chennai Mathematical Institute","ror":"https://ror.org/04zp24820","country_code":"IN","type":"education","lineage":["https://openalex.org/I19149307"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"C. Aiswarya","raw_affiliation_strings":["Chennai Mathematical Institute, Chennai, India"],"raw_orcid":"https://orcid.org/0000-0002-4878-7581","affiliations":[{"raw_affiliation_string":"Chennai Mathematical Institute, Chennai, India","institution_ids":["https://openalex.org/I19149307"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051473693","display_name":"Pascal Baumann","orcid":"https://orcid.org/0000-0002-9371-0807"},"institutions":[{"id":"https://openalex.org/I4210121786","display_name":"Max Planck Institute for Software Systems","ror":"https://ror.org/02pe2kf23","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210121786"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Pascal Baumann","raw_affiliation_strings":["MPI-SWS, Kaiserslautern, Germany"],"raw_orcid":"https://orcid.org/0000-0002-9371-0807","affiliations":[{"raw_affiliation_string":"MPI-SWS, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I4210121786"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112913148","display_name":"Prakash Saivasan","orcid":null},"institutions":[{"id":"https://openalex.org/I59611059","display_name":"Institute of Mathematical Sciences","ror":"https://ror.org/05078rg59","country_code":"IN","type":"facility","lineage":["https://openalex.org/I59611059"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Prakash Saivasan","raw_affiliation_strings":["Institute of Mathematical Sciences, Chennai, India"],"raw_orcid":"https://orcid.org/0000-0001-5060-0117","affiliations":[{"raw_affiliation_string":"Institute of Mathematical Sciences, Chennai, India","institution_ids":["https://openalex.org/I59611059"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049169897","display_name":"Lia Sch\u00fctze","orcid":"https://orcid.org/0000-0003-4002-5491"},"institutions":[{"id":"https://openalex.org/I4210121786","display_name":"Max Planck Institute for Software Systems","ror":"https://ror.org/02pe2kf23","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210121786"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Lia Sch\u00fctze","raw_affiliation_strings":["MPI-SWS, Kaiserslautern, Germany"],"raw_orcid":"https://orcid.org/0000-0003-4002-5491","affiliations":[{"raw_affiliation_string":"MPI-SWS, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I4210121786"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083429244","display_name":"Georg Zetzsche","orcid":"https://orcid.org/0000-0002-6421-4388"},"institutions":[{"id":"https://openalex.org/I4210121786","display_name":"Max Planck Institute for Software Systems","ror":"https://ror.org/02pe2kf23","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210121786"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Georg Zetzsche","raw_affiliation_strings":["MPI-SWS, Kaiserslautern, Germany"],"raw_orcid":"https://orcid.org/0000-0002-6421-4388","affiliations":[{"raw_affiliation_string":"MPI-SWS, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I4210121786"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07460357,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"10","issue":"POPL","first_page":"2142","last_page":"2173"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.8845000267028809,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.8845000267028809,"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"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.07819999754428864,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.0071000000461936,"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/treewidth","display_name":"Treewidth","score":0.8892999887466431},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.8131999969482422},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7091000080108643},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.6730999946594238},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.5848000049591064},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.5094000101089478},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.4212000072002411},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.37689998745918274}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.8892999887466431},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8131999969482422},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7091000080108643},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6730999946594238},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.5848000049591064},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.5094000101089478},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4893999993801117},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47440001368522644},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4740000069141388},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46650001406669617},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.4212000072002411},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.37689998745918274},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.358599990606308},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3538999855518341},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.3402000069618225},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3109000027179718},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.3046000003814697},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.29760000109672546},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.296999990940094},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.2802000045776367},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.27880001068115234},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2703999876976013},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2639000117778778},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.2574999928474426},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.2515999972820282}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3776716","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3776716","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3776716","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3776716","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":null,"license_id":null,"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":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":76,"referenced_works":["https://openalex.org/W56613915","https://openalex.org/W131795912","https://openalex.org/W153330214","https://openalex.org/W1492532842","https://openalex.org/W1492682035","https://openalex.org/W1493367105","https://openalex.org/W1496958170","https://openalex.org/W1496999945","https://openalex.org/W1503681652","https://openalex.org/W1505482284","https://openalex.org/W1508382620","https://openalex.org/W1544416128","https://openalex.org/W1602322980","https://openalex.org/W1646789098","https://openalex.org/W1806249174","https://openalex.org/W1821731992","https://openalex.org/W1889920293","https://openalex.org/W1989556004","https://openalex.org/W1997981086","https://openalex.org/W2008450805","https://openalex.org/W2031575609","https://openalex.org/W2036208810","https://openalex.org/W2044772623","https://openalex.org/W2060300993","https://openalex.org/W2060345611","https://openalex.org/W2074131210","https://openalex.org/W2074204229","https://openalex.org/W2076508310","https://openalex.org/W2087945397","https://openalex.org/W2089385274","https://openalex.org/W2094403718","https://openalex.org/W2094716892","https://openalex.org/W2095689360","https://openalex.org/W2100532597","https://openalex.org/W2107398710","https://openalex.org/W2121924470","https://openalex.org/W2122076344","https://openalex.org/W2135948849","https://openalex.org/W2154109182","https://openalex.org/W2162583406","https://openalex.org/W2165546792","https://openalex.org/W2166743230","https://openalex.org/W2277816930","https://openalex.org/W2346985033","https://openalex.org/W2442545619","https://openalex.org/W2528431921","https://openalex.org/W2561266941","https://openalex.org/W2757822510","https://openalex.org/W2808618195","https://openalex.org/W2880875791","https://openalex.org/W2900044545","https://openalex.org/W2962796379","https://openalex.org/W2963604037","https://openalex.org/W2963919909","https://openalex.org/W2965450052","https://openalex.org/W3021254799","https://openalex.org/W3117114237","https://openalex.org/W3138732357","https://openalex.org/W3213041887","https://openalex.org/W4200340358","https://openalex.org/W4206055592","https://openalex.org/W4206579112","https://openalex.org/W4243644740","https://openalex.org/W4251572442","https://openalex.org/W4307260824","https://openalex.org/W4315605893","https://openalex.org/W4315630654","https://openalex.org/W4316662575","https://openalex.org/W4319310895","https://openalex.org/W4387885479","https://openalex.org/W4390604707","https://openalex.org/W4392145636","https://openalex.org/W4406222188","https://openalex.org/W4409446223","https://openalex.org/W4412334559","https://openalex.org/W4416968696"],"related_works":[],"abstract_inverted_index":{"The":[0,114],"reachability":[1,132],"problem":[2],"in":[3,15,180,241,254,270],"multi-pushdown":[4],"automata":[5],"(MPDA),":[6],"or":[7,163],"equivalently,":[8],"interleaved":[9],"Dyck":[10],"reachability,":[11,109],"has":[12,238,265],"many":[13,41,53,239],"applications":[14,240],"static":[16],"analysis":[17],"of":[18,26,46,54,59,66,78,105,136,147,158,204,244,259,273],"recursive":[19,28,277],"programs.":[20],"An":[21],"example":[22,249],"is":[23,57,98,127,166,232],"safety":[24,263],"verification":[25,243,264],"multi-threaded":[27],"programs":[29,255],"with":[30,107,188,256,275],"shared":[31],"memory.":[32],"Since":[33],"these":[34,55,148],"problems":[35],"are":[36,117,208],"undecidable,":[37],"the":[38,67,76,138,155,181,201,210,242,266,271],"literature":[39],"contains":[40],"decidable":[42,108],"(and":[43],"efficient)":[44],"underapproximations":[45,56],"MPDA.":[47],"A":[48],"uniform":[49],"framework":[50],"that":[51,58,81,200,237,253],"captures":[52],"bounded":[60,125,159,169],"treewidth":[61,84,97,126,161,170],":":[62],"To":[63],"each":[64],"execution":[65],"MPDA,":[68,172],"we":[69,74,251],"associate":[70],"a":[71,83,99,128,186,193,233],"graph;":[72],"then":[73],"consider":[75],"subset":[77],"all":[79,176],"graphs":[80],"have":[82],"at":[85],"most":[86],"k":[87,92],",":[88,162],"for":[89,131,221,225],"some":[90],"constant":[91],".":[93,123],"In":[94],"fact,":[95],"bounding":[96],"generic":[100],"approach":[101],"to":[102,145,168,216],"obtain":[103],"classes":[104],"systems":[106,116,122,149,178,207],"even":[110,174],"beyond":[111],"MPDA":[112],"underapproximations.":[113],"resulting":[115],"also":[118],"called":[119],"MSO-definable":[120,205,226,260],"bounded-treewidth":[121,177],"While":[124],"powerful":[129],"tool":[130],"and":[133,173],"similar":[134],"types":[135],"analysis,":[137],"word":[139,202],"languages":[140,191,203],"(i.e.":[141],"action":[142],"sequences":[143],"corresponding":[144],"executions)":[146],"remain":[150],"far":[151],"from":[152,195],"understood.":[153],"For":[154],"slight":[156],"restriction":[157],"special":[160],"\u201cbounded-stw\u201d":[164],"(which":[165],"equivalent":[167],"on":[171],"includes":[175],"studied":[179],"literature),":[182],"this":[183,214],"work":[184],"reveals":[185],"connection":[187,215],"multiple":[189],"context-free":[190],"(MCFL),":[192],"concept":[194],"computational":[196],"linguistics.":[197],"We":[198,212],"show":[199,252],"bounded-stw":[206,227,261],"exactly":[209],"MCFL.":[211],"exploit":[213],"provide":[217],"an":[218,248],"optimal":[219],"algorithm":[220],"computing":[222],"downward":[223,230],"closures":[224,231],"systems.":[228],"Computing":[229],"notoriously":[234],"difficult":[235],"task":[236],"complex":[245],"systems:":[246],"As":[247],"application,":[250],"dynamic":[257],"spawning":[258],"processes,":[262],"same":[267],"complexity":[268],"as":[269],"case":[272],"processes":[274],"sequential":[276],"processes.":[278]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2026-01-09T00:00:00"}