@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 = jan,
day = "1",
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)",
publisher = "Springer Verlag",
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",
address = "Germany",
note = "14th International Conference onTools and Algorithms for the Construction and Analysis of Systems, TACAS2008 Held as Part of the Joint European Conf. Theory and Practice of Software, ETAPS 2008 Proceedings ; Conference date: 29-03-2008 Through 06-04-2008",
}