Using CLP Simplifications to Improve Java Bytecode Termination Analysis

Fausto Spoto (1) , Lunjin Lu , Frédéric Mesnard (2, 3)

1 UNIVR | DI - Department of Computer Science [Verona]
2 IREMIA - Institut de REcherche en Mathématiques et Informatique Appliquées
3 LIM - Laboratoire d'Informatique et de Mathématiques

In an earlier work, a termination analyzer for Java bytecode was developed that translates a Java bytecode program into a constraint logic program and then proves the termination of the latter. An efficiency bottleneck of the termination analyzer is the construction of a proof of termination for the generated constraint logic program, which is often very large in size. In this paper, a set of program simplifications are presented that reduce the size of the constraint logic program without changing its termination behavior. These simplifications remove program clauses and/or predicate arguments that do not affect the termination behavior of the constraint logic program. Their effect is to reduce significantly the time needed to build the termination proof for the constraint logic program, as our experiments show.

Mots clés: Java; Java bytecode; static analysis; termination

Domaines: Informatique [cs]

Fausto Spoto, Lunjin Lu, Frédéric Mesnard. Using CLP Simplifications to Improve Java Bytecode Termination Analysis. Fourth Workshop on Bytecode Semantics, Verification, Analysis and Transformation (BYTECODE 2009), Mar 2009, York, United Kingdom. pp.129--144, ⟨10.1016/j.entcs.2009.11.019⟩. ⟨hal-01188704⟩