A verifiable Lightweight Escape Analysis Supporting Creational Design Patterns - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2006

A verifiable Lightweight Escape Analysis Supporting Creational Design Patterns

Abstract

This paper presents a compositional escape analysis adapted for use in resource limited embedded systems. This analysis covers the full Java language, including dynamic class loading. Thanks to the use of an effcient verififation algorithm, small embedded systems are able to check the escape analysis information of mobile code. The traditional escape analysis is also extended, taking further steps towards full Java programming support, by adding the support of common design patterns, namely aggregation and factory, in order to allow the programmer to use coding techniques that are usually somewhat inefficient on these constrained systems.
Fichier principal
Vignette du fichier
RR-5937.pdf (327.75 Ko) Télécharger le fichier

Dates and versions

inria-00081200 , version 1 (22-06-2006)
inria-00081200 , version 2 (23-06-2006)

Identifiers

  • HAL Id : inria-00081200 , version 2

Cite

Gilles Grimaud, Yann Hodique, Isabelle Simplot-Ryl. A verifiable Lightweight Escape Analysis Supporting Creational Design Patterns. [Research Report] RR-5937, INRIA. 2006, pp.23. ⟨inria-00081200v2⟩
158 View
334 Download

Share

Gmail Facebook Twitter LinkedIn More