A relation algebraic model of robust correctness

DOI10.1016/0304-3975(96)88664-6zbMath0871.68125OpenAlexW1982779896MaRDI QIDQ1350502

Thomas F. Gritzner, Rudolf Berghammer

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(96)88664-6

zbMATH Keywords

weakest preconditionsdemonic nondeterminismspecification statementrelational specificationrobust correct refinementsemantics of specifications and programs

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Related Items (5)

Unifying Lazy and Strict Computations ⋮ Imperative abstractions for functional actions ⋮ Embedding a demonic semilattice in a relation algebra ⋮ Fixpoints for general correctness ⋮ Relational Semantics Revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theoretical basis for stepwise refinement and the programming calculus
• Embedding a demonic semilattice in a relation algebra
• Relation algebras: Concept of points and representability
• Predicative programming Part I
• Countable nondeterminism and random assignment
• Laws of programming
• A RELATIONAL MODEL OF DEMONIC NONDETERMINISTIC PROGRAMS
• A Transformation System for Developing Recursive Programs
• The specification statement
• Boolean Algebras with Operators

This page was built for publication: A relation algebraic model of robust correctness