Skip to Main content Skip to Navigation
Other publications

Type-based heap and stack space analysis in Java

Emmanuel Hainry 1 Romain Péchoux 1
1 CARTE - Theoretical adverse computations, and safety
LORIA - FM - Department of Formal Methods , Inria Nancy - Grand Est
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.
Document type :
Other publications
Complete list of metadatas

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/hal-00773141
Contributor : Romain Péchoux <>
Submitted on : Wednesday, November 27, 2013 - 1:59:42 PM
Last modification on : Thursday, March 5, 2020 - 4:51:50 PM
Long-term archiving on: : Saturday, April 8, 2017 - 2:50:54 AM

File

ObjectIsBeautiful.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00773141, version 4

Collections

Citation

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

Share

Metrics

Record views

408

Files downloads

199