On the total correctness of nondeterministic programs

DOI10.1016/0304-3975(81)90038-4MaRDI QIDQ1143163zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3532506 (Why is no real title available?)
• scientific article; zbMATH DE number 3558929 (Why is no real title available?)
• scientific article; zbMATH DE number 3602653 (Why is no real title available?)
• scientific article; zbMATH DE number 3609100 (Why is no real title available?)
• scientific article; zbMATH DE number 3628355 (Why is no real title available?)
• scientific article; zbMATH DE number 3060538 (Why is no real title available?)
• A Powerdomain Construction
• A Weaker Precondition for Loops
• A characterization of weakest preconditions
• First-order dynamic logic
• Guarded commands, nondeterminacy and formal derivation of programs
• Programming as a Discipline of Mathematical Nature
• Some Properties of Predicate Transformers

Cited in

(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

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

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