On the total correctness of nondeterministic programs

DOI10.1016/0304-3975(81)90038-4zbMath0441.68009OpenAlexW1966503837MaRDI QIDQ1143163

David Harel

Publication date: 1981

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(81)90038-4

zbMATH Keywords

total correctness of nondeterministic programs

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (3)

Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic ⋮ General correctness: A unification of partial and total correctness ⋮ The correctness of nondeterministic programs revisited

Cites Work

• A characterization of weakest preconditions
• First-order dynamic logic
• A Weaker Precondition for Loops
• Guarded commands, nondeterminacy and formal derivation of programs
• A Powerdomain Construction
• Some Properties of Predicate Transformers
• Programming as a Discipline of Mathematical Nature
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the total correctness of nondeterministic programs