Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Under consideration for publication in Theory and Practice of Logic Programming 1 SAT-Based Termination Analysis Using
 

Summary: Under consideration for publication in Theory and Practice of Logic Programming 1
SAT-Based Termination Analysis Using
Monotonicity Constraints over the Integers
MICHAEL CODISH, IGOR GONOPOLSKIY
Department of Computer Science, Ben-Gurion University, Israel
AMIR M. BEN-AMRAM
School of Computer Science, Tel-Aviv Academic College, Israel
CARSTEN FUHS, J¨URGEN GIESL
LuFG Informatik 2, RWTH Aachen University, Germany
submitted 1 January 2003; revised 1 January 2003; accepted 1 January 2003
Abstract
We describe an algorithm for proving termination of programs abstracted to systems of
monotonicity constraints in the integer domain. Monotonicity constraints are a non-trivial
extension of the well-known size-change termination method. While deciding termination
for systems of monotonicity constraints is PSPACE complete, we focus on a well-defined
and significant subset, which we call MCNP, designed to be amenable to a SAT-based
solution. Our technique is based on the search for a special type of ranking function
defined in terms of bounded differences between multisets of integer values. We describe
the application of our approach as the back-end for the termination analysis of Java
Bytecode (JBC). At the front-end, systems of monotonicity constraints are obtained by

  

Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)

 

Collections: Computer Technologies and Information Sciences