Weakest preconditions for pure Prolog programs
From MaRDI portal
(Redirected from Publication:293340)
Recommendations
Cites work
- scientific article; zbMATH DE number 3740740 (Why is no real title available?)
- scientific article; zbMATH DE number 1142320 (Why is no real title available?)
- scientific article; zbMATH DE number 851596 (Why is no real title available?)
- A lattice-theoretical fixpoint theorem and its applications
- Guarded commands, nondeterminacy and formal derivation of programs
- Inductive assertion method for logic pograms
- Programming as a Discipline of Mathematical Nature
- Proof methods of declarative properties of definite programs
- Ten Years of Hoare's Logic: A Survey—Part I
- Verification of logic programs
- Verification of meta-interpreters
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
- Instrumenting a weakest precondition calculus for counterexample generation
- scientific article; zbMATH DE number 1531358 (Why is no real title available?)
- Weakest pre-condition reasoning for Java programs with JML annotations
- Weakest preconditioned goto axiom
- scientific article; zbMATH DE number 4047056 (Why is no real title available?)
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)
