Static prediction of heap space usage for first-order functional programs
By M. Hofmann, Steffen Jost. ACM-SIGACT Symposium on Principles of Programming Languages, 2003
392 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Hardware and Architecture
View Paper: https://www.semanticscholar.org/paper/83296e471f97e890106012667cfa4a6ad46419fe
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Sumit Gulwani
- Trishul M. Chilimbi
- Krishna K. Mehra
- Brian Campbell
- Rishabh Singh
- Oleksandr Polozov
- Armando Solar-Lezama
- Rajeev Alur
In Hardware and Architecture
- Sumit Gulwani
- Trishul M. Chilimbi
- Brian Campbell
- Swarat Chaudhuri
- Oleksandr Polozov
- Armando Solar-Lezama
- Rishabh Singh
- Kevin Ellis
Citations in the corpus
- Amortised Memory Analysis Using the Depth of Data Structures (2009, background): “The resource polymorphism extension hypothesised in the conclusions to Hofmann and Jost’s paper [1] can also be applied to allow different function signatures to be inferred for different uses of a function, reflecting the local resource requirements.”
- SPEED: precise and efficient static estimation of program computational complexity (2009, background): “Hofmann and Jost statically infer linear bounds on heap space usage of firstorder functional programs running under a special memory mechanism [20].”