A Verifiable Lightweight Escape Analysis Supporting Creational Design Patterns

This paper presents a compositional escape analysis (EA) adapted for use in resource limited embedded systems. It covers the full Java language, including dynamic class loading. Thanks to the use of an efficient verification 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 programming support, by adding the support of common design patterns, namely aggregation and factory, in order to allow the use of coding techniques that are usually somewhat inefficient on these constrained systems.