A constraint-based algorithm for analysing memory usage on Java cards - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2004

A constraint-based algorithm for analysing memory usage on Java cards

Abstract

We address in this paper the problem of statically determining whether a JavaCard applet may produce a memory overflow because of the dynamic instantiation of classes inside cycles. We provide a constraint-based algorithm which determines potential loops and (mutually) recursive methods. The algorithm operates on the byte-code of an applet. It is written as a set of rules -one for each byte-code instruction- which allows a compositional reasoning and it comprises both inter- and intra-procedural analysis. We aimed at an algorithm suitable to be fed into the proof assistant Coq in order to extract a certified memory usage analyser. We prove termination of the algorithm as well as its soundness and completeness with respect to an abstraction of the operational semantics of the language.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-5440.pdf (386.45 Ko) Télécharger le fichier

Dates and versions

inria-00070567 , version 1 (19-05-2006)

Identifiers

  • HAL Id : inria-00070567 , version 1

Cite

Gerardo Schneider. A constraint-based algorithm for analysing memory usage on Java cards. [Research Report] RR-5440, INRIA. 2004, pp.26. ⟨inria-00070567⟩
79 View
90 Download

Share

Gmail Facebook X LinkedIn More