A SAT-based approach to size change termination with global ranking functions

Amir M. Ben-Amram, Michael Codish

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

15 Scopus citations

Abstract

We describe a new approach to proving termination with size change graphs. This is the first decision procedure for size change termination (SCT) which makes direct use of global ranking functions. It handles a well-defined and significant subset of SCT instances, designed to be amenable to a SAT-based solution. We have implemented the approach using a state-of-the-art Boolean satisfaction solver. Experimentation indicates that the approach is a viable alternative to the complete SCT decision procedure based on closure computation and local ranking functions. Our approach has the extra benefit of producing an explicit witness to prove termination in the form of a global ranking function.

Original languageEnglish
Title of host publicationTools and Algorithms for the Construction and Analysis of Systems - 14th Int. Conf., TACAS 2008 - Held as Part of the Joint European Conf. Theory and Practice of Software, ETAPS 2008 Proceedings
Pages218-232
Number of pages15
DOIs
StatePublished - 21 Jul 2008
Event"14th International Conference onTools and Algorithms for the Construction and Analysis of Systems, TACAS2008" - Budapest, Hungary
Duration: 29 Mar 20086 Apr 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4963 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference"14th International Conference onTools and Algorithms for the Construction and Analysis of Systems, TACAS2008"
Country/TerritoryHungary
CityBudapest
Period29/03/086/04/08

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'A SAT-based approach to size change termination with global ranking functions'. Together they form a unique fingerprint.

Cite this