Non-termination Analysis of Logic Programs Using Types

DOI10.1007/978-3-642-20551-4_9MaRDI QIDQ3003491zbMATH OpenOpenAlexFDO

Authors Dean Voets, Danny De Schreye

Publication date 27 May 2011

Published in Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-20551-4_9

zbMATH Keywords

non-failure analysisnon-termination analysisprogram specializationtypes

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 1692903
• A new approach to non-termination analysis of logic programs
• Static Analysis
• scientific article; zbMATH DE number 5198991
• Non-termination analysis of logic programs with integer arithmetics
• A polymorphic type dependency analysis for logic programs
• Typed static analysis: Application to the groundness analysis of typed prolog
• A type system for logic programs
• A practical analysis of non-termination in large logic programs

Cites work

• A new approach to non-termination analysis of logic programs
• A type system for logic programs
• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• Static Analysis
• Termination of logic programs: the never-ending story
• Termination prediction for general logic programs

Cited in

(12)

• scientific article; zbMATH DE number 1696593 (Why is no real title available?)
• Non-termination analysis of logic programs with integer arithmetics
• A non-termination criterion for binary constraint logic programs
• Checking termination of bottom-up evaluation of logic programs with function symbols
• A new approach to non-termination analysis of logic programs
• scientific article; zbMATH DE number 5198991 (Why is no real title available?)
• A practical analysis of non-termination in large logic programs
• Improving precision of type analysis using non-discriminative union
• Determinacy Analysis for Logic Programs Using Mode and Type Information
• Non-termination Checking for Imperative Programs
• Non-termination in Term Rewriting and Logic Programming
• Automatic inference of determinacy and mutual exclusion for logic programs using mode and type analyses

This page was built for publication: Non-termination Analysis of Logic Programs Using Types

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