Weakest preconditions for pure Prolog programs

DOI10.1016/S0020-0190(98)00098-2zbMath1339.68036OpenAlexW1964777477MaRDI QIDQ293340

Salvatore Ruggieri, Dino Pedreschi

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098000982?np=y

zbMATH Keywords

logic programmingPrologHoare logicweakest preconditionsprogram correctnessweakest liberal preconditions

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof methods of declarative properties of definite programs
• Inductive assertion method for logic pograms
• A lattice-theoretical fixpoint theorem and its applications
• Ten Years of Hoare's Logic: A Survey—Part I
• Guarded commands, nondeterminacy and formal derivation of programs
• Verification of meta-interpreters
• Verification of logic programs
• Programming as a Discipline of Mathematical Nature

This page was built for publication: Weakest preconditions for pure Prolog programs