{"id":"https://openalex.org/W7128470715","doi":"https://doi.org/10.48550/arxiv.2602.07627","title":"Series-Parallel-Loop Decompositions of Control-flow Graphs","display_name":"Series-Parallel-Loop Decompositions of Control-flow Graphs","publication_year":2026,"publication_date":"2026-02-07","ids":{"openalex":"https://openalex.org/W7128470715","doi":"https://doi.org/10.48550/arxiv.2602.07627"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2602.07627","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.07627","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2602.07627","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111361948","display_name":"Xuran Cai","orcid":"https://orcid.org/0009-0005-2626-5503"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Cai, Xuran","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125553363","display_name":"Amir Goharshady","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Goharshady, Amir","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125576968","display_name":"S Hitarth","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hitarth, S","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5086774411","display_name":"Chun Kit Lam","orcid":"https://orcid.org/0000-0002-8856-9095"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lam, Chun Kit","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5111361948"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.36910000443458557,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.36910000443458557,"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.289000004529953,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.15199999511241913,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.9064000248908997},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6988000273704529},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.5877000093460083},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.5612000226974487},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.4927000105381012},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4528999924659729},{"id":"https://openalex.org/keywords/modular-decomposition","display_name":"Modular decomposition","score":0.4171999990940094},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4068000018596649},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.392300009727478}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.9064000248908997},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6988000273704529},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6341999769210815},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.5877000093460083},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.5612000226974487},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.4927000105381012},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4918999969959259},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4528999924659729},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.4171999990940094},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4068000018596649},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.392300009727478},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.37130001187324524},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.36730000376701355},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.36730000376701355},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.3596000075340271},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.3384999930858612},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33660000562667847},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.3325999975204468},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33219999074935913},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3147999942302704},{"id":"https://openalex.org/C68103157","wikidata":"https://www.wikidata.org/wiki/Q569347","display_name":"Graph product","level":5,"score":0.30630001425743103},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.29440000653266907},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.2768999934196472},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.2630999982357025},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.25850000977516174},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.257099986076355},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2529999911785126},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2500999867916107}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2602.07627","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.07627","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2602.07627","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.07627","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Control-flow":[0],"graphs":[1,64,87,110],"(CFGs)":[2],"of":[3,31,53,86,108,123,133,172],"structured":[4,57,113],"programs":[5],"are":[6,79],"well":[7],"known":[8],"to":[9,177],"exhibit":[10],"strong":[11],"sparsity":[12,16],"properties.":[13],"Traditionally,":[14],"this":[15,94,137],"has":[17,59],"been":[18],"modeled":[19],"using":[20,173],"graph":[21],"parameters":[22,47],"such":[23],"as":[24,71],"treewidth":[25,60,66],"and":[26,42,125,151],"pathwidth,":[27],"enabling":[28],"the":[29,50,106,120,130,170],"development":[30],"faster":[32],"parameterized":[33,77],"algorithms":[34,142],"for":[35,81,143],"tasks":[36],"in":[37,91],"compiler":[38,146],"optimization,":[39],"model":[40],"checking,":[41],"program":[43],"analysis.":[44],"However,":[45],"these":[46],"only":[48],"approximate":[49],"structural":[51],"constraints":[52],"CFGs:":[54],"although":[55],"every":[56],"CFG":[58],"at":[61,67],"most~7,":[62],"many":[63],"with":[65,129],"most~7":[68],"cannot":[69],"arise":[70],"CFGs.":[72,178],"As":[73],"a":[74,82,98],"result,":[75],"existing":[76],"techniques":[78],"optimized":[80],"substantially":[83],"broader":[84],"class":[85,107],"than":[88],"those":[89],"encountered":[90],"practice.":[92],"In":[93],"work,":[95],"we":[96,139],"introduce":[97],"new":[99],"grammar-based":[100],"decomposition":[101,116],"framework":[102],"that":[103],"characterizes":[104],"\\emph{exactly}":[105],"control-flow":[109],"generated":[111],"by":[112],"programs.":[114],"Our":[115],"is":[117],"intuitive,":[118],"mirrors":[119],"syntactic":[121],"structure":[122],"programs,":[124],"remains":[126],"fully":[127],"compatible":[128],"dynamic-programming":[131],"paradigm":[132],"treewidth-based":[134],"methods.":[135],"Using":[136],"framework,":[138],"design":[140],"improved":[141],"two":[144],"classical":[145],"optimization":[147],"problems:":[148],"\\emph{Register":[149],"Allocation}":[150],"\\emph{Lifetime-Optimal":[152],"Speculative":[153],"Partial":[154],"Redundancy":[155],"Elimination":[156],"(LOSPRE)}.":[157],"Extensive":[158],"experimental":[159],"evaluation":[160],"demonstrates":[161],"significant":[162],"performance":[163],"improvements":[164],"over":[165],"previous":[166],"state-of-the-art":[167],"approaches,":[168],"highlighting":[169],"benefits":[171],"decompositions":[174],"tailored":[175],"specifically":[176]},"counts_by_year":[],"updated_date":"2026-05-01T08:36:08.643496","created_date":"2026-02-11T00:00:00"}