Relational Semantics Revisited

DOI10.1016/j.entcs.2009.07.072zbMath1339.68156OpenAlexW1997231856MaRDI QIDQ2810687

Eike Best, Kerstin Strecker

Publication date: 3 June 2016

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.07.072

zbMATH Keywords

relational semanticspowerdomainsdenotational semanticsfixpointsSmyth orderingEgli-Milner orderingHoare ordering

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Continuous lattices and posets, applications (06B35) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Relational algebraic semantics of deterministic and nondeterministic programs
• Interpretations of recursion under unbounded nondeterminacy
• A relation algebraic model of robust correctness
• Relation-algebraic semantics
• A RELATIONAL MODEL OF DEMONIC NONDETERMINISTIC PROGRAMS
• A Powerdomain Construction
• An axiomatic basis for computer programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Relational Semantics Revisited