Bytecode rewriting in Tom - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Bytecode rewriting in Tom


In this paper, we present a term rewriting based library for manipulating Java bytecode. We define a mapping from bytecode programs to algebraic terms, and we use Tom, an extension of Java that adds pattern-matching facilities, to describe transformations. An originality of Tom is that it provides a powerful strategy language to express traversals over trees and to control how transformation rules are applied. To be even more expressive, we use CTL formulae as conditions and we show how their satisfiability can be ensured using the strategy formalism. Through small examples, we show how bytecode analysis and transformations can be defined in an elegant way. In particular, we outline the implementation of a ClassLoader parameterized by a security policy that restricts file access.
Fichier principal
Vignette du fichier
bytecode.pdf (202.61 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

inria-00129513 , version 1 (07-02-2007)


  • HAL Id : inria-00129513 , version 1


Emilie Balland, Pierre-Etienne Moreau, Antoine Reilles. Bytecode rewriting in Tom. Second Workshop on Bytecode Semantics, Verification, Analysis and Transformation - BYTECODE 07, Mar 2007, Braga, Portugal. pp.19-33. ⟨inria-00129513⟩
156 View
212 Download


Gmail Mastodon Facebook X LinkedIn More