Heap-size analysis for assembly programs
type: Dataset
description: Our objective is to propose methods for resource-aware compilation inspired by the implicit complexity community. We consider a small assembly-like language and we build abstract finite machine models in order to predict a bound on the maximal heap usage of a program. We propose a polynomial time procedure to detect and certify a broad and meaningful class of non-size increasing programs, which run in a constant size heap. We end by discussing about programs running in linear heap space and discussing how to capture logarithmic space computation.
issued: 2026-05-25T01:01:17.946341
language: en
modified: 2026-05-25T01:01:17.946346
contact point: Organization
  fn: CCSD
keyword: infoeu-reposemanticspreprint
keyword: infoinfo-locomputer-science-cslogic-in-computer-science-cslo
keyword: non-size-increasing
keyword: preprints-working-papers-
keyword: program-analysis
landing page: https://hal.science/hal-00067838

Heap-size analysis for assembly programs
type: Distribution
format: HTML
issued: 2026-05-25T01:01:18.029081
modified: 2026-05-25T01:01:17.927537
access URL: https://hal.science/hal-00067838

test_moissonnage_selune
type: Agent