Inferring termination conditions for logic programs using backwards analysis

DOI10.1017/S1471068404002236zbMATH Open1093.68018OpenAlexW2148363954MaRDI QIDQ4673540FDOQ4673540

Authors: Samir Genaim, Michael Codish 

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/s1471068404002236

Recommendations

• Inferring termination conditions for logic programs using backwards analysis
• scientific article; zbMATH DE number 1834571
• Static Analysis
• Inference of termination conditions for numerical loops in Prolog
• scientific article; zbMATH DE number 1948416

zbMATH Keywords

abstract interpretationbackwards analysisprogram analysistermination analysis

Mathematics Subject Classification ID

Logic programming (68N17)

Cited In (6)

• Title not available (Why is that?)
• Logic Based Program Synthesis and Transformation
• Static Analysis
• Inferring termination conditions for logic programs using backwards analysis
• Title not available (Why is that?)
• Termination prediction for general logic programs

This page was built for publication: Inferring termination conditions for logic programs using backwards analysis

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