cTI: a constraint-based termination inference tool for ISO-Prolog

DOI10.1017/S1471068404002017zbMath1093.68559OpenAlexW2121932590MaRDI QIDQ4673545

Fred Mesnard, Roberto Bagnara

Publication date: 29 April 2005

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1471068404002017

zbMATH Keywords

logic programmingabstract interpretationtermination analysisTermination inference

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (7)

Correctness and Completeness of Logic Programs ⋮ Loop detection in term rewriting using the eliminating unfoldings ⋮ A New Approach to Non-termination Analysis of Logic Programs ⋮ Termination prediction for general logic programs ⋮ Applications of polyhedral computations to the analysis and verification of hardware and software systems ⋮ Termination Analysis of Logic Programs Based on Dependency Graphs ⋮ Finite-tree analysis for constraint logic-based languages

This page was built for publication: cTI: a constraint-based termination inference tool for ISO-Prolog