Type-based amortised heap-space analysis

64Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.

This artice is free to access.

Abstract

We present a type system for a compile-time analysis of heap-space requirements of Java style object-oriented programs with explicit deallocation. Our system is based on an amortised complexity analysis: the data is arbitrarily assigned a potential related to its size and layout; allocations must be "payed for" from this potential. The potential of each input then furnishes an upper bound on the heap space usage for the computation on this input. We successfully treat inheritance, downcast, update and aliasing. Example applications for the analysis include destination-passing style and doubly-linked lists. Type inference is explicitly not included; the contribution lies in the system itself and the nontrivial soundness theorem. This extended abstract elides most technical lemmas and proofs, even nontrivial ones, due to space limitations. A full version is available at the authors' web pages. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Hofmann, M., & Jost, S. (2006). Type-based amortised heap-space analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3924 LNCS, pp. 22–37). https://doi.org/10.1007/11693024_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free