Mathematical theory of partial correctness

DOI10.1016/S0022-0000(71)80035-1MaRDI QIDQ2545842zbMATH OpenFDO

Authors Zohar Manna

Publication date 1971

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0022-0000(71)80035-1

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites work

• Formalization of Properties of Functional Programs
• scientific article; zbMATH DE number 3448070 (Why is no real title available?)
• scientific article; zbMATH DE number 3302923 (Why is no real title available?)
• scientific article; zbMATH DE number 3322506 (Why is no real title available?)
• scientific article; zbMATH DE number 3349291 (Why is no real title available?)
• scientific article; zbMATH DE number 3351179 (Why is no real title available?)
• scientific article; zbMATH DE number 3415379 (Why is no real title available?)
• Nondeterministic Algorithms
• Proving assertions about parallel programs
• The correctness of nondeterministic programs

Cited in

(10)

• Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. I
• Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. II
• On the completeness of the inductive assertion method
• Correctness of parallel programs: The Church-Rosser approach
• The correctness of nondeterministic programs
• Current methods for proving program correctness
• Verification of correctness of parallel algorithms in practice
• Hoare logic-based genetic programming
• Synthetic programming
• Correctness of recursive parallel nondeterministic flow programs

This page was built for publication: Mathematical theory of partial correctness

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