HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

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.
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Friday, June 23, 2006 - 10:39:20 AM
Last modification on : Wednesday, February 23, 2022 - 11:58:02 AM
Long-term archiving on: : Monday, September 20, 2010 - 4:08:22 PM


  • HAL Id : inria-00081200, version 2



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⟩



Record views


Files downloads