Skip to Main content Skip to Navigation
New interface
Conference papers

Types for controlling heap and stack in Java

Emmanuel Hainry 1 Romain Péchoux 1 
1 CARTE - Theoretical adverse computations, and safety
Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
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 as it analyzes most object oriented features like overload, inheritance, and also handles flow statements controlled by objects.
Document type :
Conference papers
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download
Contributor : Romain Péchoux Connect in order to contact the contributor
Submitted on : Wednesday, November 27, 2013 - 2:57:47 PM
Last modification on : Wednesday, February 2, 2022 - 3:52:50 PM
Long-term archiving on: : Friday, February 28, 2014 - 6:15:22 AM


Files produced by the author(s)


  • HAL Id : hal-00910166, version 1



Emmanuel Hainry, Romain Péchoux. Types for controlling heap and stack in Java. Third International Workshop on Foundational and Practical Aspects of Resource Analysis (FOPARA), Ugo Dal Lago and Ricardo Pena, Aug 2013, Bertinoro, Italy. ⟨hal-00910166⟩



Record views


Files downloads