Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Complexity Preserving Transformation from Jinja Bytecode to Rewrite
  Systems   We revisit known transformations from Jinja bytecode 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 novel
representation of JBC executions as "constrained rewrite systems". We prove
non-termination and complexity preservation of the transformation. We restrict
to well-formed JBC programs that only make use of non-recursive methods and
expect tree-shaped objects as input. Our approach allows for simplified
correctness proofs and provides a framework for the combination of the
computation graph method with standard techniques from static program analysis
like for example "reachability analysis".

8
The categories of this paper are: hep-ex
7
The categories of this paper are: hep-th
4
The categories of this paper are: cond-mat
35
The categories of this paper are: mtrl-th
5
The categories of this paper are: gr-qc
14
The categories of this paper are: math-ph
22
The categories of this paper are: chao-dyn
28
The categories of this paper are: alg-geom
11
The categories of this paper are: hep-lat
13
The categories of this paper are: quant-ph
37
The categories of this paper are: supr-con
16
The categories of this paper are: stat
20
The categories of this paper are: acc-phys
32
The categories of this paper are: atom-ph
12
The categories of this paper are: nucl-th
17
The categories of this paper are: q-fin