Type-based heap and stack space analysis 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 since it analyzes most object oriented features like overload, inheritance, override.
Type de document :
Autre publication
Rapport technique. 2013
Liste complète des métadonnées

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

https://hal.inria.fr/hal-00773141
Contributeur : Romain Péchoux <>
Soumis le : mercredi 27 novembre 2013 - 13:59:42
Dernière modification le : jeudi 11 janvier 2018 - 06:21:25
Document(s) archivé(s) le : samedi 8 avril 2017 - 02:50:54

Fichier

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

Identifiants

  • HAL Id : hal-00773141, version 4

Collections

Citation

Emmanuel Hainry, Romain Péchoux. Type-based heap and stack space analysis in Java. Rapport technique. 2013. 〈hal-00773141v4〉

Partager

Métriques

Consultations de la notice

346

Téléchargements de fichiers

101