A simple relation between relational and predicate transformer semantics for nondeterministic programs

DOI10.1016/0020-0190(80)90048-4zbMath0468.68012OpenAlexW2077049952MaRDI QIDQ1156476

Mila E. Majster-Cederbaum

Publication date: 1980

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(80)90048-4

zbMATH Keywords

relational semanticssemanticsnondeterministic programspredicate transformer

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Related Items (5)

Predicate transformers as power operations ⋮ General correctness: A unification of partial and total correctness ⋮ Semantics of algorithmic languages ⋮ On the notion of expressiveness and the rule of adaptation ⋮ Constructive design of a hierarchy of semantics of a transition system by abstract interpretation

Cites Work

• Complementary definitions of programming language semantics
• Consistent and complementary formal theories of the semantics of programming languages
• Guarded commands, nondeterminacy and formal derivation of programs
• Soundness and Completeness of an Axiom System for Program Verification
• Unnamed Item
• Unnamed Item

This page was built for publication: A simple relation between relational and predicate transformer semantics for nondeterministic programs