Predicate transformers as power operations

DOI10.1007/BF01211604zbMath0835.68075MaRDI QIDQ1898816

Ingrid Rewitzky, Chris Brink

Publication date: 25 September 1995

Published in: Formal Aspects of Computing (Search for Journal in Brave)

zbMATH Keywords

relational semanticspredicate transformer semanticspower concentration

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55)

Cites Work

• A calculus of refinements for program derivations
• A simple relation between relational and predicate transformer semantics for nondeterministic programs
• On correct refinement of programs
• The clean termination of iterative programs
• Combining angels, demons and miracles in program specifications
• A characterization of weakest preconditions
• Power domains
• First-order dynamic logic
• Statement inversion and strongest postcondition
• Power structures
• General correctness: A unification of partial and total correctness
• Consistent and complementary formal theories of the semantics of programming languages
• Varieties of complex algebras
• Laws of programming
• A RELATIONAL MODEL OF DEMONIC NONDETERMINISTIC PROGRAMS
• Guarded commands, nondeterminacy and formal derivation of programs
• A Powerdomain Construction
• Some Properties of Predicate Transformers
• An axiomatic basis for computer programming
• The Theory of Representation for Boolean Algebras
• Boolean Algebras with Operators. Part I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Predicate transformers as power operations