A verifiable lightweight escape analysis supporting creational design patterns for small embedded systems

Abstract : This paper presents a compositional escape analysis (EA) adapted for use in resource limited embedded sys- tems. It covers the full Java language, including dynamic class loading. Thanks to the use of an efficient verifica- tion algorithm, small embedded systems are able to check the EA information of mobile code. The traditional EA is also extended, taking further steps towards full Java pro- gramming support, by adding the support of common de- sign patterns, namely aggregation and factory, in order to allow the use of coding techniques that are usually some- what inefficient on these constrained systems.
Type de document :
Communication dans un congrès
Proc. of the 2007 IEEE International Symposium on Ubisafe Computing (UbiSafe-07), 2007, Niagara Falls, Canada. IEEE Computer Society, pp.440--447, 2007
Liste complète des métadonnées

https://hal.inria.fr/inria-00546597
Contributeur : Isabelle Simplot-Ryl <>
Soumis le : mardi 14 décembre 2010 - 14:29:21
Dernière modification le : jeudi 11 janvier 2018 - 06:22:13

Identifiants

  • HAL Id : inria-00546597, version 1

Collections

Citation

Gilles Grimaud, Yann Hodique, Isabelle Simplot-Ryl. A verifiable lightweight escape analysis supporting creational design patterns for small embedded systems. Proc. of the 2007 IEEE International Symposium on Ubisafe Computing (UbiSafe-07), 2007, Niagara Falls, Canada. IEEE Computer Society, pp.440--447, 2007. 〈inria-00546597〉

Partager

Métriques

Consultations de la notice

184