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

DOI10.1016/0020-0190(80)90048-4zbMATH Open0468.68012OpenAlexW2077049952MaRDI QIDQ1156476FDOQ1156476

Authors: Mila 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

semanticsrelational semanticsnondeterministic programspredicate transformer

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Soundness and Completeness of an Axiom System for Program Verification
• Guarded commands, nondeterminacy and formal derivation of programs
• Consistent and complementary formal theories of the semantics of programming languages
• Complementary definitions of programming language semantics
• Title not available (Why is that?)

Cited In (5)

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

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

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