{"id":"https://openalex.org/W7127567765","doi":"https://doi.org/10.48550/arxiv.2602.03588","title":"Efficient Algorithms for Partial Constraint Satisfaction Problems over Control-flow Graphs","display_name":"Efficient Algorithms for Partial Constraint Satisfaction Problems over Control-flow Graphs","publication_year":2026,"publication_date":"2026-02-03","ids":{"openalex":"https://openalex.org/W7127567765","doi":"https://doi.org/10.48550/arxiv.2602.03588"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.03588","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","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":null,"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":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5125051692","display_name":"Amir Goharshady","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Goharshady, Amir","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.7005000114440918,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.7005000114440918,"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/T10142","display_name":"Formal Methods in Verification","score":0.08340000361204147,"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.05339999869465828,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6600000262260437},{"id":"https://openalex.org/keywords/constraint-satisfaction-dual-problem","display_name":"Constraint satisfaction dual problem","score":0.5699999928474426},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.5404000282287598},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4327999949455261},{"id":"https://openalex.org/keywords/constraint-graph","display_name":"Constraint graph","score":0.4300000071525574},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.42980000376701355},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4124000072479248},{"id":"https://openalex.org/keywords/unification","display_name":"Unification","score":0.391400009393692},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.3887999951839447},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3837999999523163}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6600000262260437},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.5699999928474426},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.5404000282287598},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4438999891281128},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4424000084400177},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4327999949455261},{"id":"https://openalex.org/C178481205","wikidata":"https://www.wikidata.org/wiki/Q5164372","display_name":"Constraint graph","level":5,"score":0.4300000071525574},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.42980000376701355},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41269999742507935},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4124000072479248},{"id":"https://openalex.org/C96146094","wikidata":"https://www.wikidata.org/wiki/Q609057","display_name":"Unification","level":2,"score":0.391400009393692},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.3887999951839447},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3837999999523163},{"id":"https://openalex.org/C128916667","wikidata":"https://www.wikidata.org/wiki/Q1343660","display_name":"Register allocation","level":3,"score":0.3815999925136566},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.38089999556541443},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3546000123023987},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.3458000123500824},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.3434999883174896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3328999876976013},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.32899999618530273},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3237999975681305},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.3077999949455261},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.3034999966621399},{"id":"https://openalex.org/C198414033","wikidata":"https://www.wikidata.org/wiki/Q5155607","display_name":"Comparability graph","level":5,"score":0.2863999903202057},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2669999897480011},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.26669999957084656},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2619999945163727},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2578999996185303},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.2565000057220459},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.2558000087738037},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.2531000077724457},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2500999867916107}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.03588","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.03588","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.03588","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":"pmh:doi:10.48550/arxiv.2602.03588","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,30,76,108,184,257],"this":[1,185,233],"work,":[2,186],"we":[3,34,88,110,187,259],"focus":[4],"on":[5,189],"the":[6,24,31,77,97,129,163,190,220,223,278,282],"Partial":[7,151],"Constraint":[8,26],"Satisfaction":[9,27],"Problem":[10,28],"(PCSP)":[11],"over":[12,142,206,263],"control-flow":[13,143,170,224],"graphs":[14,171,208],"(CFGs)":[15],"of":[16,23,38,42,80,96,158,172,182,213,222,248,281],"programs.":[17],"PCSP":[18,266],"serves":[19],"as":[20,140,194,243],"a":[21,36,40,45,62,69,119,125,180,201,210,235,244],"generalization":[22,245],"well-known":[25,168],"(CSP).":[29],"CSP":[32],"framework,":[33],"define":[35],"set":[37,41],"variables,":[39],"constraints,":[43],"and":[44,87,99,155,177,246,255],"finite":[46],"domain":[47,231],"$D$":[48],"that":[49,71,127,169,227],"encompasses":[50],"all":[51,72],"possible":[52],"values":[53],"for":[54,112,204,228,252],"each":[55,65,94,106],"variable.":[56],"The":[57],"objective":[58],"is":[59,85,167,200],"to":[60,64,93,105,115,123],"assign":[61],"value":[63],"variable":[66,91],"in":[67,179],"such":[68],"way":[70],"constraints":[73,103,114],"are":[74,175],"satisfied.":[75],"graph":[78,84,98],"variant":[79],"CSP,":[81],"an":[82],"underlying":[83],"considered":[86],"have":[89],"one":[90,100],"corresponding":[92,104],"vertex":[95],"or":[101],"several":[102],"edge.":[107],"PCSPs,":[109],"allow":[111],"certain":[113],"be":[116,138,241],"violated":[117],"at":[118],"specified":[120],"cost,":[121],"aiming":[122],"find":[124],"solution":[126],"minimizes":[128],"total":[130],"cost.":[131],"Numerous":[132],"classical":[133,265],"compiler":[134],"optimization":[135],"tasks":[136],"can":[137,240],"framed":[139],"PCSPs":[141,205],"graphs.":[144],"Examples":[145],"include":[146],"Register":[147],"Allocation,":[148],"Lifetime-optimal":[149],"Speculative":[150],"Redundancy":[152],"Elimination":[153],"(LOSPRE),":[154],"Optimal":[156,269],"Placement":[157],"Bank":[159,270],"Selection":[160],"Instructions.":[161],"On":[162],"other":[164],"hand,":[165],"it":[166],"structured":[173],"programs":[174],"sparse":[176],"decomposable":[178],"variety":[181],"ways.":[183],"rely":[188],"Series-Parallel-Loop":[191],"(SPL)":[192],"decompositions":[193],"introduced":[195],"by~\\cite{RegisterAllocation}.":[196],"Our":[197,238],"main":[198],"contribution":[199],"general":[202],"algorithm":[203,239],"SPL":[207],"with":[209],"time":[211],"complexity":[212],"\\(O(|G|":[214],"\\cdot":[215],"|D|^6)\\),":[216],"where":[217],"\\(|G|\\)":[218],"represents":[219],"size":[221],"graph.":[225],"Note":[226],"any":[229],"fixed":[230],"$D,$":[232],"yields":[234],"linear-time":[236],"solution.":[237],"seen":[242],"unification":[247],"previous":[249,279],"SPL-based":[250],"approaches":[251],"register":[253],"allocation":[254],"LOSPRE.":[256],"addition,":[258],"provide":[260],"experimental":[261],"results":[262],"another":[264],"task,":[267],"i.e.":[268],"Selection,":[271],"achieving":[272],"runtimes":[273],"four":[274],"times":[275],"better":[276],"than":[277],"state":[280],"art.":[283]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-06T00:00:00"}