Inferring Termination Conditions for Logic Programs using Backwards Analysis

Simple item page
dc.creatorGenaim, Samir
dc.creatorCodish, Michael
dc.date2003-12-12
dc.date.accessioned2026-07-07T03:20:43Z
dc.date.available2026-07-07T03:20:43Z
dc.descriptionThis 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.
dc.identifierhttps://arxiv.org/abs/cs/0312023
dc.identifierhttp://arxiv.org/abs/cs/0312023
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31922
dc.subjectProgramming Languages
dc.subjectD.1.6,F.3.1
dc.titleInferring Termination Conditions for Logic Programs using Backwards Analysis
dc.typetext

Files

Collections

arXiv