A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems

Details A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems

2012-04-06

arxiv.org/abs/1204.1568v2

Computer Science

Programming Languages

33 pages

Scientific paper

We revisit known transformations from Jinja bytecode to rewrite systems from the viewpoint of runtime complexity. Suitably generalising the construction 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 rewrite systems. We show that the transformation from JBC programs to rewrite systems is sound, that is, an infinite execution gives rise to an infinite derivation in the rewrite system. Moreover, we establish that the transformation is complexity preserving, that is, the complexity of the obtained rewrite system forms an upper bound on the complexity of the JBC program.

Affiliated with

Also associated with

No associations

Rating

A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-36908