Relational Semantics Revisited

Authors:
Eike Best;Kerstin Strecker
Affiliations:
Parallel Systems, Department of Computing Science, Carl von Ossietzky Universität, D-26111 Oldenburg, Germany;Max-Planck Gymnasium, D-37073 Göttingen, Germany
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 11
Cited 0

Denotational semantics: a methodology for language development

Denotational semantics: a methodology for language development
Relational algebraic semantics of deterministic and nondeterministic programs

Theoretical Computer Science
Interpretations of recursion under unbounded nondeterminacy

Theoretical Computer Science
The formal semantics of programming languages: an introduction

The formal semantics of programming languages: an introduction
A relation algebraic model of robust correctness

Theoretical Computer Science
Relation-algebraic semantics

Theoretical Computer Science
Semantics of sequential and parallel programs

Semantics of sequential and parallel programs
An axiomatic basis for computer programming

Communications of the ACM
Mathematical Theory of Program Correctness

Mathematical Theory of Program Correctness
A Discipline of Programming

A Discipline of Programming
A Relational Model of Programs Without the Restriction to Egli-Milner-Monotone Constructs

PROCOMET '94 Proceedings of the IFIP TC2/WG2.1/WG2.2/WG2.3 Working Conference on Programming Concepts, Methods and Calculi

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes the systematic use of fixpoints for the relational semantics of unboundedly nondeterministic sequential programs. The focus is on analysing the expressiveness of various semantic definitions and of powerdomains including or excluding an 'error' element @?.