ScholarLens Back to search
1978•DAIMI Report SeriesOpen access

Connection between Dijkstra's Predicate-Transformers and Denotational Continuation-Semantics

Kurt Jensen

Open full text 7 citations

Abstract

It is important to define and relate different semantic methods. In particular it is interesting to compare semantics for program- verification with those aimed for program execution. In this paper the intuitive background for a number of different semantics is given. They are all reformulated to the notation of denotational semantics and compared. It is shown that Dijkstra's weakest predicate theory is satisfied by a denotational continuation-semantics. The present paper is an improved and shortened version of DAIMI PB-61.

Open-access reader

About this research paper

What this paper is about

It is important to define and relate different semantic methods. In particular it is interesting to compare semantics for program- verification with those aimed for program execution. In this paper the intuitive background for a number of different semantics is given. They are all reformulated to the notation of denotational semantics and compared. It is shown that Dijkstra's weakest predicate theory is satisfied by a denotational continuation-semantics. The present paper is an improved and shortened version of DAIMI PB-61.

Why it matters

OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

It is important to define and relate different semantic methods. In particular it is interesting to compare semantics for program- verification with those aimed for program execution. In this paper the intuitive background for a number of different semantics is given. They are all reformulated to the notation of denotational semantics and compared. It is shown that Dijkstra's weakest predicate theory is satisfied by a denotational continuation-semantics. The present paper is an improved and shortened version of DAIMI PB-61.

Key concepts: Denotational semantics, Denotational semantics of the Actor model, Normalisation by evaluation, Predicate transformer semantics, Programming language, Dijkstra's algorithm, Computer science, Action semantics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Connection between Dijkstra's Predicate-Transformers and Denotational Continuation-Semantics — Research Paper | ScholarLens