First fully dynamic algorithm maintains loop nesting forests in reducible flow graphs via local updates to depth-first spanning trees.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
other 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
other 1polarities
unclear 1representative citing papers
Free-variable sets and a nesting tree can replace dominance relations in SSA for higher-order programs, improving precision without requiring explicit control-flow graphs.
citing papers explorer
-
Fully Dynamic Maintenance of Loop Nesting Forests in Reducible Flow Graphs
First fully dynamic algorithm maintains loop nesting forests in reducible flow graphs via local updates to depth-first spanning trees.
-
SSA without Dominance for Higher-Order Programs
Free-variable sets and a nesting tree can replace dominance relations in SSA for higher-order programs, improving precision without requiring explicit control-flow graphs.