On Termination of Binary CLP Programs

  • Alexander Serebrenik
  • Fred Mesnard
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3573)

Abstract

Termination of binary CLP programs has recently become an important question in the termination analysis community. The reason for this is due to the fact that some of the recent approaches to termination of logic programs abstract the input program to a binary CLP program and conclude termination of the input program from termination of the abstracted program. In this paper we introduce a class of binary CLP programs such that their termination can be proved by using linear level mappings. We show that membership to this class is decidable and present a decision procedure. Further, we extend this class to programs such that their termination proofs require a combination of linear functions. In particular we consider as level mappings tuples of linear functions and piecewise linear functions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Alexander Serebrenik
    • 1
  • Fred Mesnard
    • 2
  1. 1.Laboratory of Quality of Software (LaQuSo)T.U.EindhovenEindhovenThe Netherlands
  2. 2.IREMIAUniversité de La RéunionFrance

Personalised recommendations