Automated modular termination proofs for real Prolog programs

DOI10.1007/3-540-61739-6_44MaRDI QIDQ5030196zbMATH OpenOpenAlexFDO

Authors

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

automated theorem provingformal methodsPrologstatic analysistermination

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)

Recommendations

• scientific article; zbMATH DE number 879005
• scientific article; zbMATH DE number 1487846
• Modular and incremental automated termination proofs
• Automated termination proofs for logic programs by term rewriting
• On modular termination proofs of general logic programs
• scientific article; zbMATH DE number 3924108
• Proving termination properties of prolog programs: A semantic approach
• Automated verification of Prolog programs
• Proving termination of general Prolog programs

Cites work

• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• scientific article; zbMATH DE number 50648 (Why is no real title available?)
• scientific article; zbMATH DE number 107881 (Why is no real title available?)
• scientific article; zbMATH DE number 3467028 (Why is no real title available?)
• scientific article; zbMATH DE number 752977 (Why is no real title available?)
• scientific article; zbMATH DE number 867332 (Why is no real title available?)
• scientific article; zbMATH DE number 879005 (Why is no real title available?)
• scientific article; zbMATH DE number 970705 (Why is no real title available?)
• Norms on terms and their use in proving universal termination of a logic program
• Proof theory. An introduction
• Reasoning about prolog programs: From modes through types to assertions
• Reasoning about termination of pure Prolog programs
• Strong termination of logic programs

Cited in

(6)

• Reasoning about prolog programs: From modes through types to assertions
• Automated Termination in Model Checking Modulo Theories
• scientific article; zbMATH DE number 4176501 (Why is no real title available?)
• scientific article; zbMATH DE number 1540615 (Why is no real title available?)
• Automated verification of Prolog programs
• scientific article; zbMATH DE number 879005 (Why is no real title available?)

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

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