Inferring termination conditions for logic programs using backwards analysis

Samir Genaim, Michael Codish

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

21 Scopus citations

Abstract

This paper focuses on the inference of modes for which a logic program is guaranteed to terminate.This generalizes traditional termination analysis where an analyzer tries to verify termination for a specified mode.The contribution is a methodology which combines traditional termination analysis and backwards analysis to obtain termination inference.This leads to a better understanding of termination inference, simplifies its formal justification, and facilitates implementation.We evaluate the application of this approach to enhance an existing termination analyzer to perform also termination inference.

Original languageEnglish
Title of host publicationLogic for Programming, Artificial Intelligence, and Reasoning - 8th International Conference, LPAR 2001, Proceedings
EditorsRobert Nieuwenhuis, Andrei Voronkov
PublisherSpringer Verlag
Pages685-694
Number of pages10
ISBN (Electronic)9783540429579
DOIs
StatePublished - 1 Jan 2001
Event8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR 2001 - Havana, Cuba
Duration: 3 Dec 20017 Dec 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2250
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR 2001
Country/TerritoryCuba
CityHavana
Period3/12/017/12/01

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

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

Cite this