Type-based heap and stack space analysis in Java - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Other Publications Year : 2013

Type-based heap and stack space analysis in Java

Abstract

A type system is introduced for a strict but expressive subset of Java in order to infer resource upper bounds on both the heap-space and the stack-space requirements of typed programs. This type system is inspired by previous works on Implicit Computational Complexity, using tiering and non-interference techniques. The presented methodology has several advantages. First, it provides explicit polynomial upper bounds to the programmer, hence avoiding OutOfMemory and StackOverFlow errors. Second, type checking is decidable in linear time. Last, it has a good expressivity since it analyzes most object oriented features like overload, inheritance, override.
Fichier principal
Vignette du fichier
ObjectIsBeautiful.pdf (404.08 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00773141 , version 1 (11-01-2013)
hal-00773141 , version 2 (13-01-2013)
hal-00773141 , version 3 (04-10-2013)
hal-00773141 , version 4 (27-11-2013)

Identifiers

  • HAL Id : hal-00773141 , version 4

Cite

Emmanuel Hainry, Romain Péchoux. Type-based heap and stack space analysis in Java. 2013. ⟨hal-00773141v4⟩
318 View
189 Download

Share

Gmail Facebook X LinkedIn More