A Provably Correct Stackless Intermediate Representation for Java Bytecode - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

A Provably Correct Stackless Intermediate Representation for Java Bytecode

Résumé

The Java virtual machine executes stack-based bytecode. The intensive use of an operand stack has been identified as a major obstacle for static analysis and it is now common for static analysis tools to manipulate a stackless intermediate representation (IR) of bytecode programs. This paper provides such a bytecode transformation, describes its semantic correctness and evaluates its performance. We provide the semantic foundations for proving that an initial program and its IR behave similarly, in particular with respect to object creation and throwing of exceptions. The correctness of this transformation is proved with respect to a relation on execution traces taking into account that the object allocation order is not preserved by the transformation.
Fichier principal
Vignette du fichier
main.pdf (144.91 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00537815 , version 1 (19-11-2010)

Identifiants

  • HAL Id : inria-00537815 , version 1

Citer

Delphine Demange, Thomas Jensen, David Pichardie. A Provably Correct Stackless Intermediate Representation for Java Bytecode. The 8th Asian Symposium on Programming Languages and Systems (APLAS), 2010, Shangai, China. ⟨inria-00537815⟩
315 Consultations
230 Téléchargements

Partager

Gmail Facebook X LinkedIn More