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

DOI10.1017/S1471068404002017MaRDI QIDQ4673545zbMATH OpenOpenAlexFDO

Authors 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

abstract interpretationlogic programmingtermination analysisTermination inference

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 1834571
• Termination of constraint logic programs
• Static Analysis
• Termination prediction for general logic programs
• A general framework for automatic termination analysis od logic programs

Cited in

(7)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4673545)