Towards a General Framework for Formal Reasoning about Java Bytecode Transformation

Abstract

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 transformatio

The Effects of Static Analysis for Dynamic Software Updating: An Exploratory Study

“…Many works have recognized that program analysis plays an important role in finding software flaws [7], [26]- [28]. Program analysis can be implemented either statically, dynamically, or in a combination of both [24], [25].…”

Enabling code transformations with FermaT on simplified bytecode

“…A formal framework with a focus on verifying direct bytecode transformations with the goal of eliminating errors that might be introduced by the transformation is presented in Lounas et al The approach is based around embedDSU, which works with Java Card applications, but the framework may be applied to others systems as well. The framework defines formal semantics for static analysis of code that can be used to verify that no type errors were introduced by transformations, as well as using Hoare triples and predicate transformations to check if the behavioural aspects of programs were modified with the changes.…”