Academic Journal

SAT-based termination analysis using monotonicity constraints over the integers.

Bibliographic Details
Title: SAT-based termination analysis using monotonicity constraints over the integers.
Authors: CODISH, MICHAEL, GONOPOLSKIY, IGOR, BEN-AMRAM, AMIR M., FUHS, CARSTEN, GIESL, JÜRGEN
Superior Title: Theory & Practice of Logic Programming; Jul2011, Vol. 11 Issue 4/5, p503-520, 18p
Subject Terms: MONOTONIC functions, CONSTRAINT satisfaction, DATA encryption, JAVA programming language, LOGIC programming, PROGRAMMING languages
Abstract: We describe an algorithm for proving termination of programs abstracted to systems of monotonicity constraints in the integer domain. Monotonicity constraints are a nontrivial 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 (for “monotonicity constraints in NP”), 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. At the front end, systems of monotonicity constraints are obtained by abstracting information, using two different termination analyzers: AProVE and COSTA. Preliminary results reveal that our approach provides a good trade-off between precision and cost of analysis. [ABSTRACT FROM AUTHOR]
Copyright of Theory & Practice of Logic Programming is the property of Cambridge University Press and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Complementary Index
Description
Description not available.