Skip to Main content Skip to Navigation
New interface
Conference papers

A Provably Correct Stackless Intermediate Representation for Java Bytecode

Delphine Demange 1 Thomas Jensen 1 David Pichardie 1 
1 CELTIQUE - Software certification with semantic analysis
Inria Rennes – Bretagne Atlantique , IRISA-D4 - LANGAGE ET GÉNIE LOGICIEL
Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : David Pichardie Connect in order to contact the contributor
Submitted on : Friday, November 19, 2010 - 2:12:04 PM
Last modification on : Thursday, January 20, 2022 - 4:20:12 PM
Long-term archiving on: : Friday, October 26, 2012 - 4:01:44 PM


Files produced by the author(s)


  • HAL Id : inria-00537815, version 1


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⟩



Record views


Files downloads