We present a purely syntactical deenition of E.W. Dijkstra's predicate transformer wp for nondeterministic while-programs in innnitary logic. Then we show that it is sound wrt. a deenition of weakest preconditions given in terms of denotational semantics.

An algebra of actors Aπ fully captures the properties of actors based on asynchronous π-calculus, but, it is based on the interleaving bisimulation semantics. We adjust Aπ to Aπtc to make Aπ having a truly concurrent semantics. We give the syntax and operational semantics of Aπtc, and also the truly concurrent semantics model and algebraic laws of Aπtc.

Game Semantics has successfully provided fully abstract models for a variety of programming languages not possible using other denotational approaches. Although it is a flexible and accurate way to give semantics to a language, its underlying mathematics is awkward. For example, the proofs that strategies compose associatively and maintain properties imposed on them such as innocence are intric...

The paper introduces a semantics for logic programs based on rst order hereditary Harrop formulas which are expressed in terms of intuitionistic derivations. The derivations are constructed by means of an intuitionistic proof procedure that constitutes the resolution mechanism of the language. The semantics of a program is a goal independent denotation which can be equivalently speciied by a de...

This paper develops a truly concurrent semantical approach, whereby concurrency is notionally independent of nondeterminism, that allows describing the deterministically concurrent behaviour of recursive processes accessing consumable resources. The process semantics is based on the new coherently complete and prime algebraic domains of real and complex multi-pomsets. The process language that ...

CSP# (Communicating Sequential Programs) is a modelling language designed for specifying concurrent systems by integrating CSP-like compositional operators with sequential programs updating shared variables. In this paper, we define an observation-oriented denotational semantics in an open environment for the CSP# language based on the UTP framework. To deal with shared variables, we lift tradi...

Denotational semantics of logic programming and its extensions (by allowing negation, disjunctions, or both) have been studied thoroughly for many years. In 1998, game semantics were given to definite logic programs by Di Cosmo, Loddo, and Nicolet, and a few years later they were extended to deal with negation by Rondogiannis and Wadge. Both approaches were proven equivalent with the traditiona...

Both operational and denotational semantics are prominent approaches for reasoning about properties of programs and programming languages. In the categorical framework developed by Turi and Plotkin both styles of semantics are unified using a single, syntax independent format, known as GSOS, in which the operational rules of a language are specified. From this format, the operational and denota...

In this paper we explain the semantic foundations of the tool Probabilistic VERUS Har98]. A Probabilistic VERUS program P consists of sequential randomized processes S 1 ; : : : ; S k that are executed in parallel and that communicate via shared variables. First we give an operational semantics for the sequential components on the basis of a transition relation deened in the classical SOS-style...