A new approach to non-termination analysis of logic programs

DOI10.1007/978-3-642-02846-5_21MaRDI QIDQ4649732zbMATH OpenOpenAlexFDO

Authors Dean Voets, Danny De Schreye

Publication date 13 November 2012

Published in Logic Programming (Search for Journal in Brave)

Full work available at URL https://lirias.kuleuven.be/handle/123456789/243648

zbMATH Keywords

program analysisnon-termination analysis

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Non-termination Analysis of Logic Programs Using Types
• Non-termination analysis of logic programs with integer arithmetics
• scientific article; zbMATH DE number 1948416
• Termination prediction for general logic programs
• A practical analysis of non-termination in large logic programs

Cites work

• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• scientific article; zbMATH DE number 813263 (Why is no real title available?)
• Automated Termination Analysis for Logic Programs by Term Rewriting
• Proving Termination with (Boolean) Satisfaction
• Termination prediction for general logic programs
• cTI: a constraint-based termination inference tool for ISO-Prolog

Cited in

(6)

• Non-termination analysis of logic programs with integer arithmetics
• Non-termination in Term Rewriting and Logic Programming
• A semantic basis for the termination analysis of logic programs
• Non-termination Analysis of Logic Programs Using Types
• Static Analysis
• scientific article; zbMATH DE number 1834571 (Why is no real title available?)

This page was built for publication: A new approach to non-termination analysis of logic programs

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