Memory Allocation for Constant-Bounded Programs
This work shows that constant boundedness enables a tight, polynomial-time approximation of optimal stack usage by viewing control flow as a tree and applying a tree-scan allocation strategy augmented with memory defragmentation, and guarantees memory usage bounded by the maximum live memory plus, at most, the size of...