Abstract

We revisit known transformations from object-oriented bytecode programs to rewrite systems from the viewpoint of runtime complexity. Suitably generalising the constructions proposed in the literature, we define an alternative representation of Jinja bytecode (JBC) executions as computation graphs from which we obtain a representation of JBC executions as constrained rewrite systems. We show that the transformation is complexity preserving. We restrict to non-recursive methods and make use of heap shape pre-analyses.

BibTeX

@unpublished{GMMS-WPTE14,
  author    = "Georg Moser and Michael Schaper",
  title     = "A Complexity Preserving Transformation from {Jinja} Bytecode
               to Rewrite Systems",
  note      = "Presented at {WPTE} 2014",
  year      = 2014
}