Towards a General Framework for Formal Reasoning about Java Bytecode Transformation

Program transformation has gained a wide interest since it is used for several purposes: altering semantics of a program, adding features to a program or performing optimizations. In this paper we focus on program transformations at the bytecode level. Because these transformations may introduce err...

Full description

Saved in:
Bibliographic Details
Published inElectronic proceedings in theoretical computer science Vol. 122; no. Proc. SCSS 2012; pp. 63 - 73
Main Authors Lounas, Razika, Mezghiche, Mohamed, Lanet, Jean-Louis
Format Journal Article
LanguageEnglish
Published Open Publishing Association 30.07.2013
Online AccessGet full text

Cover

More Information
Summary:Program transformation has gained a wide interest since it is used for several purposes: altering semantics of a program, adding features to a program or performing optimizations. In this paper we focus on program transformations at the bytecode level. Because these transformations may introduce errors, our goal is to provide a formal way to verify the update and establish its correctness. The formal framework presented includes a definition of a formal semantics of updates which is the base of a static verification and a scheme based on Hoare triples and weakest precondition calculus to reason about behavioral aspects in bytecode transformation
ISSN:2075-2180
2075-2180
DOI:10.4204/EPTCS.122.6