{"id":"https://openalex.org/W4379537148","doi":"https://doi.org/10.1145/3591233","title":"Recursive State Machine Guided Graph Folding for Context-Free Language Reachability","display_name":"Recursive State Machine Guided Graph Folding for Context-Free Language Reachability","publication_year":2023,"publication_date":"2023-06-06","ids":{"openalex":"https://openalex.org/W4379537148","doi":"https://doi.org/10.1145/3591233"},"language":"en","primary_location":{"id":"doi:10.1145/3591233","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3591233","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3591233","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://dl.acm.org/doi/pdf/10.1145/3591233","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082964108","display_name":"Yuxiang Lei","orcid":"https://orcid.org/0000-0002-4484-8172"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Yuxiang Lei","raw_affiliation_strings":["University of New South Wales, Australia"],"raw_orcid":"https://orcid.org/0000-0002-4484-8172","affiliations":[{"raw_affiliation_string":"University of New South Wales, Australia","institution_ids":["https://openalex.org/I31746571"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053058502","display_name":"Yulei Sui","orcid":"https://orcid.org/0000-0002-9510-6574"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Yulei Sui","raw_affiliation_strings":["University of New South Wales, Australia"],"raw_orcid":"https://orcid.org/0000-0002-9510-6574","affiliations":[{"raw_affiliation_string":"University of New South Wales, Australia","institution_ids":["https://openalex.org/I31746571"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051957977","display_name":"Shin Hwei Tan","orcid":"https://orcid.org/0000-0001-8633-3372"},"institutions":[{"id":"https://openalex.org/I60158472","display_name":"Concordia University","ror":"https://ror.org/0420zvk78","country_code":"CA","type":"education","lineage":["https://openalex.org/I60158472"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Shin Hwei Tan","raw_affiliation_strings":["Concordia University, Canada"],"raw_orcid":"https://orcid.org/0000-0001-8633-3372","affiliations":[{"raw_affiliation_string":"Concordia University, Canada","institution_ids":["https://openalex.org/I60158472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078231842","display_name":"Qirun Zhang","orcid":"https://orcid.org/0000-0001-5367-9377"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Qirun Zhang","raw_affiliation_strings":["Georgia Institute of Technology, USA"],"raw_orcid":"https://orcid.org/0000-0001-5367-9377","affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology, USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3668,"has_fulltext":true,"cited_by_count":13,"citation_normalized_percentile":{"value":0.94090202,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":"7","issue":"PLDI","first_page":"318","last_page":"342"},"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.9926999807357788,"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.9926999807357788,"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/T10142","display_name":"Formal Methods in Verification","score":0.9839000105857849,"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/T12808","display_name":"Ferroelectric and Negative Capacitance Devices","score":0.9810000061988831,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.9600282907485962},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5818431377410889},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5337677001953125},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5223970413208008},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4985213279724121},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.462560772895813},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45147931575775146},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38289874792099}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9600282907485962},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5818431377410889},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5337677001953125},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5223970413208008},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4985213279724121},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.462560772895813},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45147931575775146},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38289874792099},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3591233","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3591233","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3591233","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"}],"best_oa_location":{"id":"doi:10.1145/3591233","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3591233","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3591233","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/G1453356816","display_name":"SHF:Small: Debug Information Validation for Optimizing Compilers","funder_award_id":"2114627","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1534947637","display_name":null,"funder_award_id":"1917924 and 2114627","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1643666990","display_name":null,"funder_award_id":"N66001- 21-C-4024","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G1830883894","display_name":"SHF:Small:Scalable and Precise Program Analyses via Linear Conjunctive Language Reachability","funder_award_id":"1917924","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"},{"id":"https://openalex.org/F4320332815","display_name":"Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4379537148.pdf","grobid_xml":"https://content.openalex.org/works/W4379537148.grobid-xml"},"referenced_works_count":52,"referenced_works":["https://openalex.org/W1589089428","https://openalex.org/W1966032455","https://openalex.org/W1984451181","https://openalex.org/W1990051509","https://openalex.org/W1996567876","https://openalex.org/W2035260626","https://openalex.org/W2044199853","https://openalex.org/W2060439939","https://openalex.org/W2074131210","https://openalex.org/W2080573945","https://openalex.org/W2084063516","https://openalex.org/W2093080079","https://openalex.org/W2096587139","https://openalex.org/W2117948828","https://openalex.org/W2118382442","https://openalex.org/W2119137801","https://openalex.org/W2120248756","https://openalex.org/W2137477742","https://openalex.org/W2138369269","https://openalex.org/W2145911832","https://openalex.org/W2148755014","https://openalex.org/W2151033407","https://openalex.org/W2151385549","https://openalex.org/W2151562310","https://openalex.org/W2151670874","https://openalex.org/W2156881251","https://openalex.org/W2169304846","https://openalex.org/W2297774820","https://openalex.org/W2493901872","https://openalex.org/W2547862110","https://openalex.org/W2582132278","https://openalex.org/W2777662281","https://openalex.org/W2891057055","https://openalex.org/W2892948282","https://openalex.org/W2978234104","https://openalex.org/W2998965762","https://openalex.org/W3005402394","https://openalex.org/W3005667672","https://openalex.org/W3009945260","https://openalex.org/W3013983845","https://openalex.org/W3033694951","https://openalex.org/W3033736373","https://openalex.org/W3033818254","https://openalex.org/W3095860260","https://openalex.org/W3107793421","https://openalex.org/W3126200532","https://openalex.org/W3163858947","https://openalex.org/W4234849644","https://openalex.org/W4237417046","https://openalex.org/W4244831445","https://openalex.org/W4307731800","https://openalex.org/W4361805830"],"related_works":["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","https://openalex.org/W2772294324","https://openalex.org/W4253760428","https://openalex.org/W2047831585"],"abstract_inverted_index":{"Context-free":[0],"language":[1],"reachability":[2],"(CFL-reachability)":[3],"is":[4,55,78,87,191,269],"a":[5,36,40,46,61,102,201,228,323,328,351,356],"fundamental":[6],"framework":[7],"for":[8,306],"program":[9],"analysis.":[10],"A":[11],"large":[12],"variety":[13],"of":[14,76,79,99,116,161,170,251,267,276,312,316,318,325,332,340,344,346,353,360],"static":[15],"analyses":[16],"can":[17,139,233],"be":[18,140],"formulated":[19],"as":[20],"CFL-reachability":[21,54,77,100,155,196,202],"problems,":[22],"which":[23,232],"determines":[24],"whether":[25,235],"specific":[26],"source-sink":[27],"pairs":[28,180],"in":[29,128,219,224,278],"an":[30,167,174,206,211,258],"edge-labeled":[31],"graph":[32,71,108,208,229,253,260,302],"are":[33,239],"connected":[34],"by":[35,49,136,241,298],"reachable":[37,126,188],"path,":[38],"i.e.,":[39,119],"path":[41,127],"whose":[42],"edge":[43],"labels":[44],"form":[45,169],"string":[47],"accepted":[48],"the":[50,69,74,84,97,106,114,143,148,154,159,162,182,186,195,215,252,274,279,300,319,347],"given":[51,200],"CFL.":[52],"Computing":[53],"expensive.":[56],"The":[57,264],"fastest":[58],"algorithm":[59,262],"exhibits":[60],"slightly":[62],"subcubic":[63],"time":[64,85,265],"complexity":[65,86,266],"with":[66,146,205,271],"respect":[67,272],"to":[68,176,184,193,273],"input":[70,107,207,280,301,320,348],"size.":[72,109,303],"Improving":[73],"scalability":[75,98],"practical":[80,104],"interest,":[81],"but":[82],"reducing":[83,299],"inherently":[88],"difficult.":[89],"In":[90,198],"this":[91],"paper,":[92],"we":[93,172,226,256],"focus":[94],"on":[95,214,284],"improving":[96],"from":[101,113],"more":[103],"perspective---reducing":[105],"Our":[110,282],"idea":[111],"arises":[112],"existence":[115],"trivial":[117,137],"edges,":[118],"edges":[120,138,149,317,345],"that":[121,132,293],"do":[122],"not":[123],"affect":[124],"any":[125],"CFL-reachability.":[129],"We":[130],"observe":[131],"two":[133,144,236,285],"nodes":[134,145,238,277,313,341],"joined":[135],"folded---by":[141],"merging":[142],"all":[147],"joining":[150],"them":[151],"removed---without":[152],"affecting":[153],"result.":[156],"By":[157],"studying":[158],"characteristic":[160],"recursive":[163],"state":[164,222],"machines":[165],"(RSMs),":[166],"alternative":[168],"CFLs,":[171],"propose":[173,227,257],"approach":[175],"identify":[177],"foldable":[178,240],"node":[179],"without":[181],"need":[183],"verify":[185],"underlying":[187],"paths":[189,218],"(which":[190],"equivalent":[192],"solving":[194],"problem).":[197],"particular,":[199],"problem":[203],"instance":[204],"G":[209,220],"and":[210,221,246,289,314,327,342,355],"RSM,":[212,225],"based":[213],"correspondence":[216],"between":[217],"transitions":[223],"folding":[230,254,261],"principle,":[231,255],"determine":[234],"adjacent":[237],"examining":[242],"only":[243],"their":[244],"incoming":[245],"outgoing":[247],"edges.":[248],"On":[249,304],"top":[250],"efficient":[259],"GF.":[263],"GF":[268,294,309,337],"linear":[270],"number":[275],"graph.":[281],"evaluations":[283],"clients":[286],"(alias":[287],"analysis":[288],"value-flow":[290,307],"analysis)":[291],"show":[292],"significantly":[295],"accelerates":[296],"RSM/CFL-reachability":[297],"average,":[305],"analysis,":[308,336],"reduces":[310,338],"60.96%":[311],"42.67%":[315],"graphs,":[321,349],"obtaining":[322,350],"speedup":[324,352],"4.65\u00d7":[326],"memory":[329,357],"usage":[330,358],"reduction":[331,359],"57.35%.":[333],"For":[334],"alias":[335],"38.93%":[339],"35.61%":[343],"3.21\u00d7":[354],"65.19%.":[361]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":2}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}