Using CLP Simplifications to Improve Java Bytecode Termination Analysis - Université de La Réunion Access content directly
Conference Papers Year : 2009

Using CLP Simplifications to Improve Java Bytecode Termination Analysis

Abstract

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.
Fichier principal
Vignette du fichier
1-s2.0-S1571066109004691-main.pdf (348.68 Ko) Télécharger le fichier
Origin Publication funded by an institution
Loading...

Dates and versions

hal-01188704 , version 1 (07-06-2018)

Identifiers

Cite

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⟩
81 View
104 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More