A Verifiable Lightweight Escape Analysis Supporting Creational Design Patterns

Author

Grimaud, Gilles ; Hodique, Yann ; Simplot-Ryl, Isabelle

Author_Institution

CNRS, Univ. de Lille I, Villeneuve d´´Ascq

Volume

2

fYear

2007

fDate

21-23 May 2007

Firstpage

440

Lastpage

447

Abstract

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.

Keywords

Java; embedded systems; formal verification; object-oriented programming; Java language; Java programming support; compositional escape analysis; creational design patterns; embedded systems; verifiable lightweight escape analysis; verification algorithm; Containers; Embedded system; Java; Memory management; Optical reflection; Pattern analysis; Performance analysis; Production facilities; Programming profession; Runtime;

fLanguage

English

Publisher

ieee

Conference_Titel

Advanced Information Networking and Applications Workshops, 2007, AINAW '07. 21st International Conference on

Conference_Location

Niagara Falls, Ont.

Print_ISBN

978-0-7695-2847-2

Type

conf

DOI

10.1109/AINAW.2007.65

Filename

4224144