Applying static analysis techniques for inferring termination conditions of logic programs
From MaRDI portal
Recommendations
- Inferring termination conditions for logic programs using backwards analysis
- Inferring termination conditions for logic programs using backwards analysis
- A semantic basis for the termination analysis of logic programs
- Automated Termination Analysis for Logic Programs by Term Rewriting
- A general framework for automatic termination analysis od logic programs
- A new approach to non-termination analysis of logic programs
- A proof-theoretic approach to the static analysis of logic programs
- Detecting optimal termination conditions of logic programs
- Static analysis for logic-based dynamic programs
Cited in
(10)- Runtime complexity analysis of logically constrained rewriting
- Termination analysis of tabled logic programs using mode and type information
- Inferring termination conditions for logic programs using backwards analysis
- Automated termination analysis for logic programs with cut
- scientific article; zbMATH DE number 1223557 (Why is no real title available?)
- Detecting optimal termination conditions of logic programs
- Inference of termination conditions for numerical loops in Prolog
- Inferring termination conditions for logic programs using backwards analysis
- cTI: a constraint-based termination inference tool for ISO-Prolog
- A semantic basis for the termination analysis of logic programs
This page was built for publication: Applying static analysis techniques for inferring termination conditions of logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4779112)
