{"id":"https://openalex.org/W7154582859","doi":"https://doi.org/10.48550/arxiv.2604.13664","title":"Fully Dynamic Maintenance of Loop Nesting Forests in Reducible Flow Graphs","display_name":"Fully Dynamic Maintenance of Loop Nesting Forests in Reducible Flow Graphs","publication_year":2026,"publication_date":"2026-04-15","ids":{"openalex":"https://openalex.org/W7154582859","doi":"https://doi.org/10.48550/arxiv.2604.13664"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.13664","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.13664","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.2604.13664","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003549623","display_name":"Gregory Morse","orcid":"https://orcid.org/0000-0002-0231-6557"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Morse, Gregory","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5133773556","display_name":"Tam\u00e1s Kozsik","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kozsik, Tam\u00e1s","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"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.7775999903678894,"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.7775999903678894,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.04089999943971634,"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.04010000079870224,"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/correctness","display_name":"Correctness","score":0.7767000198364258},{"id":"https://openalex.org/keywords/nesting","display_name":"Nesting (process)","score":0.6765000224113464},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.609000027179718},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.5449000000953674},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.4846999943256378},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47530001401901245},{"id":"https://openalex.org/keywords/for-loop","display_name":"For loop","score":0.3605000078678131},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.3167000114917755},{"id":"https://openalex.org/keywords/control-flow-graph","display_name":"Control flow graph","score":0.3124000132083893}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7767000198364258},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7268000245094299},{"id":"https://openalex.org/C2776937656","wikidata":"https://www.wikidata.org/wiki/Q2229669","display_name":"Nesting (process)","level":2,"score":0.6765000224113464},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.609000027179718},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.5449000000953674},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5202999711036682},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.4846999943256378},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47530001401901245},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.38769999146461487},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.37139999866485596},{"id":"https://openalex.org/C2779624466","wikidata":"https://www.wikidata.org/wiki/Q838119","display_name":"For loop","level":3,"score":0.3605000078678131},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3402000069618225},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3271999955177307},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3167000114917755},{"id":"https://openalex.org/C27458966","wikidata":"https://www.wikidata.org/wiki/Q1187693","display_name":"Control flow graph","level":2,"score":0.3124000132083893},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.3107999861240387},{"id":"https://openalex.org/C160191386","wikidata":"https://www.wikidata.org/wiki/Q868299","display_name":"Control flow","level":2,"score":0.295199990272522},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.2865999937057495},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.2800999879837036},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.27320000529289246},{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.2709999978542328},{"id":"https://openalex.org/C99580578","wikidata":"https://www.wikidata.org/wiki/Q5319002","display_name":"Dynamic problem","level":2,"score":0.2685000002384186},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2653999924659729},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.263700008392334},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.2624000012874603},{"id":"https://openalex.org/C2777796570","wikidata":"https://www.wikidata.org/wiki/Q2351326","display_name":"Dynamic logic (digital electronics)","level":4,"score":0.2615000009536743},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.2606000006198883},{"id":"https://openalex.org/C102379954","wikidata":"https://www.wikidata.org/wiki/Q2589940","display_name":"Call graph","level":2,"score":0.26019999384880066},{"id":"https://openalex.org/C88468194","wikidata":"https://www.wikidata.org/wiki/Q1172416","display_name":"Data-flow analysis","level":3,"score":0.2540000081062317},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.2533999979496002}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.13664","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.13664","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.2604.13664","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.13664","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":[{"score":0.6864811778068542,"id":"https://metadata.un.org/sdg/15","display_name":"Life in Land"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Loop":[0],"nesting":[1,68],"forests":[2,69],"(LNFs)":[3],"are":[4,31],"a":[5,137],"fundamental":[6],"abstraction":[7,140],"for":[8,28,65,141],"reasoning":[9],"about":[10],"control-flow":[11,72],"structure,":[12],"enabling":[13],"applications":[14],"such":[15],"as":[16,136],"compiler":[17,143],"optimizations,":[18],"program":[19],"analysis,":[20,119],"and":[21,91,117,120,144],"dominator":[22],"computation.":[23],"While":[24],"efficient":[25,49,127],"static":[26],"algorithms":[27],"constructing":[29],"LNFs":[30,135],"well":[32],"understood,":[33],"maintaining":[34,66],"them":[35],"under":[36,88],"dynamic":[37,50,63,80,139],"graph":[38],"updates":[39,96],"has":[40],"remained":[41],"largely":[42],"unexplored":[43],"due":[44],"to":[45,83,100],"the":[46,60,104,123],"lack":[47],"of":[48,103,129],"depth-first":[51,105],"search":[52],"(DFS)":[53],"maintenance.":[54],"In":[55],"this":[56],"paper,":[57],"we":[58],"present":[59],"first":[61],"fully":[62],"algorithm":[64],"loop":[67,86],"in":[70,79],"reducible":[71],"graphs.":[73],"Our":[74,132],"approach":[75],"leverages":[76],"recent":[77],"advances":[78],"DFS":[81],"maintenance":[82],"incrementally":[84],"update":[85],"structure":[87],"edge":[89],"insertions":[90],"deletions.":[92],"We":[93,111],"show":[94],"that":[95],"can":[97],"be":[98],"confined":[99],"local":[101],"regions":[102],"spanning":[106],"tree,":[107],"avoiding":[108],"global":[109],"recomputation.":[110],"provide":[112],"formal":[113],"invariants,":[114],"correctness":[115],"arguments,":[116],"complexity":[118],"demonstrate":[121],"how":[122],"maintained":[124],"LNF":[125],"enables":[126],"derivation":[128],"dominance":[130],"information.":[131],"results":[133],"establish":[134],"practical":[138],"modern":[142],"analysis":[145],"pipelines.":[146]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-17T00:00:00"}