Weakest preconditions for pure Prolog programs
From MaRDI portal
Publication:293340
DOI10.1016/S0020-0190(98)00098-2zbMATH Open1339.68036OpenAlexW1964777477MaRDI QIDQ293340FDOQ293340
Authors: Dino Pedreschi, Salvatore Ruggieri 
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
Recommendations
Hoare logicweakest preconditionslogic programmingprogram correctnessPrologweakest liberal preconditions
Cites Work
- A lattice-theoretical fixpoint theorem and its applications
- Ten Years of Hoare's Logic: A Survey—Part I
- Title not available (Why is that?)
- Title not available (Why is that?)
- Inductive assertion method for logic pograms
- Guarded commands, nondeterminacy and formal derivation of programs
- Verification of meta-interpreters
- Title not available (Why is that?)
- Verification of logic programs
- Programming as a Discipline of Mathematical Nature
- Proof methods of declarative properties of definite programs
Cited In (8)
- Weakest Preconditions for High-Level Programs
- Some Variants of the Weakest Precondition in Nondeterminism
- Weakest relative precondition semantics. Balancing approved theory and realistic translation verification
- Title not available (Why is that?)
- Instrumenting a weakest precondition calculus for counterexample generation
- Weakest pre-condition reasoning for Java programs with JML annotations
- Weakest preconditioned goto axiom
- Title not available (Why is that?)
This page was built for publication: Weakest preconditions for pure Prolog programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293340)
