A verifiable Lightweight Escape Analysis Supporting Creational Design Patterns

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

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

International audienceThis 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