© University of Kent - Contact | Feedback | Legal | FOI | Cookies
On Modular Termination Proofs
Jonathan C. Martin and Andy King
Technical Report 13-03, University of Kent, Computing Laboratory, October 2003.Abstract
Reasoning about termination is a key issue in logic program development. One classic technique for proving termination is to construct a well-founded order on goals that decreases between successive goals in a derivation. In practise, this is achieved with the aid of a level mapping that maps atoms to natural numbers. This paper examines why it can be difficult to base termination proofs on natural level mappings that directly relate to the recursive structure of the program. The notions of bounded-recurrency and bounded-acceptability are introduced to alleviate these problems. These concepts are equivalent to the classic notions of recurrency and acceptability respectively, yet provide practical criteria for constructing termination proofs in terms of natural level mappings. Moreover, the construction is entirely modular in that termination conditions are derived in a bottom-up fashion by considering, in turn, each the strongly connected components of the program.
Download publication 360 kbytes (PostScript)Bibtex Record
@techreport{1747,
author = {Jonathan C. Martin and Andy King},
title = {On {M}odular {T}ermination {P}roofs},
month = {October},
year = {2003},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2003/1747},
publication_type = {techreport},
submission_id = {29275_1069503438},
number = {13-03},
institution = {University of Kent, Computing Laboratory},
}