Using CLP Simplifications to Improve Java Bytecode Termination Analysis
Published in Electronic Notes in Theoretical Computer Science • Nov 28, 2009
NobleIDNI7P29W48R34S87
Authors:,,
Fausto Spoto
Lunjin Lu
Fred Mesnard
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...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!