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

DOI10.1016/0020-0190(80)90048-4MaRDI QIDQ1156476zbMATH OpenOpenAlexFDO

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

• scientific article; zbMATH DE number 3754073 (Why is no real title available?)
• scientific article; zbMATH DE number 3574936 (Why is no real title available?)
• 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

Cited in

(5)

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

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)