The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Static prediction of heap space usage for first-order functional programs
Abstract
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs.The analysis takes space reuse by explicit deallocation into account and also furnishes an upper bound on the heap usage in the presence of garbage collection. It covers a wide variety of examples including, for instance, the familiar sorting algorithms for lists, including quicksort.The analysis relies on a type system with resource annotations. Linear programming (LP) is used to automatically infer derivations in this enriched type system.We also show that integral solutions to the linear programs derived correspond to programs that can be evaluated without any operating system support for memory management. The particular integer linear programs arising in this way are shown to be feasibly solvable under mild assumptions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Necula, G. C. (1997) · Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '97 · doi:10.1145/263699.263712 · Cited by 1,843
Definitional interpreters for higher-order programming languages
Reynolds, J. C. (1972) · Proceedings of the ACM annual conference on - ACM '72 · doi:10.1145/800194.805852 · Cited by 669
Region-Based Memory Management
Tofte, M., & Talpin, J.-P. (1997) · Information and Computation · doi:10.1006/inco.1996.2613 · Cited by 615
Crary, K., & Weirich, S. (2000) · Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/325694.325716 · Cited by 218
Kobayashi, N. (1999) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/292540.292546 · Cited by 91
Odersky, M. (1992) · Lecture notes in computer science · doi:10.1007/3-540-55253-7_23 · Cited by 32
The computer science laboratory
Eckhouse, R. H. (1972) · doi:10.1145/800155.805001 · Cited by 27
Lambda-Upsilon-Omega: An assistant algorithms analyzer
Flajolet, P., Salvy, B., & Zimmermann, P. (1989) · Lecture notes in computer science · doi:10.1007/3-540-51083-4_60 · Cited by 22
Topics in Semantics-based Program Manipulation
Grobauer, B. (2001) · Cited by 9
Cited by
Marwedel, P. (2021) · Embedded Systems · doi:10.1007/978-3-030-60910-8 · Cited by 605
SPEED: precise and efficient static estimation of program computational complexity
Gulwani, S., Mehra, K. K., & Chilimbi, T. (2009) · Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1480881.1480898 · Cited by 266
Metadata
- Authors
- Hofmann, M., & Jost, S.
- Venue
- Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
- Publisher
- ACM
- Published
- 2003-01-15
- Pages
- 185-197
- OpenAlex
- W2068055184
- Cited by
- 294
- References
- 9
- FWCI
- 11.54
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Static prediction of heap space usage for first-order functional programs. https://app.cochat.ai/papers/10.1145/604131.604148
- The paper
- Hofmann, M., & Jost, S. (2003). Static prediction of heap space usage for first-order functional programs. Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages. https://doi.org/10.1145/604131.604148
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.