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.