Metraipolis › archive › dc_db46db4fc543
Memory Allocation for Constant-Bounded Programs — arXiv:2608.14471
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.14471
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T04:08:47.542Z
- SHA-256 of the archived text
23df9edc54c769e18a34264e702863dc976f6a31555e65a12505953288d6a7d9- Stable URL of this page
https://metraipolis.com/documento/dc_db46db4fc543
How to cite
Memory Allocation for Constant-Bounded Programs — arXiv:2608.14471 — arXiv (en), https://arxiv.org/abs/2608.14471 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_db46db4fc543 (Metraipolis archive dc_db46db4fc543, sha256 23df9edc54c769e18a34264e702863dc976f6a31555e65a12505953288d6a7d9)
BibTeX
@misc{dcdb46db4fc543,
title = {Memory Allocation for Constant-Bounded Programs — arXiv:2608.14471},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.14471},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_db46db4fc543; sha256 23df9edc54c769e18a34264e702863dc976f6a31555e65a12505953288d6a7d9},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.14471. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This work studies memory allocation for constant-bounded programs, whose execution length is syntactically limited for all inputs. Examples of such programs include verified kernel extensions, cryptographic routines, and fixed-shape machine-learning models. We show 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. Our approach guarantees memory usage bounded by the maximum live memory plus, at most, the size of the largest buffer, and is optimal when in-place swapping is permitted. We deploy the proposed allocator in two scenarios. First, in an Elixir-to-eBPF compiler, as a spiller that optimizes stack space. Second, as a static heap allocator for bounded MLIR programs using the Structured Control-Flow dialect. Results demonstrate stack reductions exceeding 90% on real eBPF workloads and show that, even under aggressive code expansion, defragmentation is rarely required and memory usage remains a small fraction of that required by naive allocation strategies. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-08-17 in cs.PL). Categorie arXiv: Programming Languages (cs.PL). Pagina del lavoro: https://arxiv.org/abs/2608.14471 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-19T04:00:26.549Z dalla pagina https://arxiv.org/catchup/cs.PL/2026-08-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).