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

Amir M. Ben-Amram; Michael Codish

doi:10.1007/978-3-540-78800-3_16

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

Amir M. Ben-Amram, Michael Codish

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Tools 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
Pages	218-232
Number of pages	15
DOIs	https://doi.org/10.1007/978-3-540-78800-3_16
State	Published - 21 Jul 2008
Event	"14th International Conference onTools and Algorithms for the Construction and Analysis of Systems, TACAS2008" - Budapest, Hungary Duration: 29 Mar 2008 → 6 Apr 2008

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4963 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/Territory	Hungary
City	Budapest
Period	29/03/08 → 6/04/08

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-78800-3_16

Cite this

Ben-Amram, A. M., & Codish, M. (2008). A SAT-based approach to size change termination with global ranking functions. In Tools 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 (pp. 218-232). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4963 LNCS). https://doi.org/10.1007/978-3-540-78800-3_16

Ben-Amram, Amir M. ; Codish, Michael. / A SAT-based approach to size change termination with global ranking functions. Tools 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. 2008. pp. 218-232 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{e2524e636d6145e1bbfb0dc2b63cd9cc,

title = "A SAT-based approach to size change termination with global ranking functions",

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.",

author = "Ben-Amram, {Amir M.} and Michael Codish",

year = "2008",

month = jul,

day = "21",

doi = "10.1007/978-3-540-78800-3_16",

language = "English",

isbn = "3540787992",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "218--232",

booktitle = "Tools 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",

note = "{"}14th International Conference onTools and Algorithms for the Construction and Analysis of Systems, TACAS2008{"} ; Conference date: 29-03-2008 Through 06-04-2008",

}

Ben-Amram, AM & Codish, M 2008, A SAT-based approach to size change termination with global ranking functions. in Tools 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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4963 LNCS, pp. 218-232, "14th International Conference onTools and Algorithms for the Construction and Analysis of Systems, TACAS2008", Budapest, Hungary, 29/03/08. https://doi.org/10.1007/978-3-540-78800-3_16

A SAT-based approach to size change termination with global ranking functions. / Ben-Amram, Amir M.; Codish, Michael.
Tools 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. 2008. p. 218-232 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4963 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Ben-Amram, Amir M.

AU - Codish, Michael

PY - 2008/7/21

Y1 - 2008/7/21

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=47249153602&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-78800-3_16

DO - 10.1007/978-3-540-78800-3_16

M3 - Conference contribution

AN - SCOPUS:47249153602

SN - 3540787992

SN - 9783540787990

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 218

EP - 232

BT - Tools 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

T2 - "14th International Conference onTools and Algorithms for the Construction and Analysis of Systems, TACAS2008"

Y2 - 29 March 2008 through 6 April 2008

ER -

Ben-Amram AM, Codish M. A SAT-based approach to size change termination with global ranking functions. In Tools 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. 2008. p. 218-232. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-78800-3_16

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

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this