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.
Type de document :
Communication dans un congrès
Third International Workshop on Foundational and Practical Aspects of Resource Analysis (FOPARA), Aug 2013, Bertinoro, Italy. 2013
Liste complète des métadonnées

Littérature citée [26 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00910166
Contributeur : Romain Péchoux <>
Soumis le : mercredi 27 novembre 2013 - 14:57:47
Dernière modification le : vendredi 9 février 2018 - 10:48:02
Document(s) archivé(s) le : vendredi 28 février 2014 - 06:15:22

Fichier

ObjectIsBeautiful.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00910166, version 1

Collections

Citation

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), Aug 2013, Bertinoro, Italy. 2013. 〈hal-00910166〉

Partager

Métriques

Consultations de la notice

278

Téléchargements de fichiers

102