Automated modular termination proofs for real Prolog programs

DOI10.1007/3-540-61739-6_44zbMath1483.68060OpenAlexW1521528545MaRDI QIDQ5030196

No author found.

Publication date: 16 February 2022

Published in: Static Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61739-6_44

zbMATH Keywords

formal methodsstatic analysisterminationPrologautomated theorem proving

Mathematics Subject Classification ID

Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites Work

• Reasoning about termination of pure Prolog programs
• Norms on terms and their use in proving universal termination of a logic program
• Reasoning about prolog programs: From modes through types to assertions
• Proof theory. An introduction
• Strong termination of logic programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Automated modular termination proofs for real Prolog programs