Inferring termination conditions for logic programs using backwards analysis

Samir Genaim, Michael Codish

Research output: Contribution to journalReview articlepeer-review

10 Scopus citations


This paper focuses on the inference of modes for which a logic program is guaranteed to terminate. This generalises traditional termination analysis where an analyser tries to verify termination for a specified mode. Our contribution is a methodology in which components of traditional termination analysis are combined with backwards analysis to obtain an analyser for termination inference. We identify a condition on the components of the analyser which guarantees that termination inference will infer all modes which can be checked to terminate. The application of this methodology to enhance a traditional termination analyser to perform also termination inference is demonstrated.

Original languageEnglish
Pages (from-to)75-91
Number of pages17
JournalTheory and Practice of Logic Programming
Issue number1-2
StatePublished - 1 Jan 2005


  • Abstract interpretation
  • Backwards analysis
  • Program analysis
  • Termination analysis

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics
  • Artificial Intelligence


Dive into the research topics of 'Inferring termination conditions for logic programs using backwards analysis'. Together they form a unique fingerprint.

Cite this