Connection between Dijkstra's Predicate-Transformers and Denotational Continuation-Semantics
DOI:
https://doi.org/10.7146/dpb.v7i86.6502Abstract
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.Downloads
Published
1978-01-01
How to Cite
Jensen, K. (1978). Connection between Dijkstra’s Predicate-Transformers and Denotational Continuation-Semantics. DAIMI Report Series, 7(86). https://doi.org/10.7146/dpb.v7i86.6502
Issue
Section
Articles
License
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.