In previous work with Pous, we defined a semantics for CCS which may both be viewed as an innocent presheaf semantics and as a concurrent game semantics. It is here proved that a behavioural equivalence induced by this semantics on CCS processes is fully abstract for fair testing equivalence. The proof relies on a new algebraic notion called playground, which represents the ‘rule of the game’. ...

Deductive verification techniques for C11 programs have advanced significantly in recent years with the development of operational semantics and associated logics increasingly large fragments C11. However, these been developed a restricted setting to avoid thin-air-read problem. In this paper, we propose an that leverages intra-thread partial order (called semantic dependencies) induced by rece...

In this paper we consider synchronous parallel programs P that are composed by sequential randomized processes S Sk which communicate via shared variables First we give an operational semantics for the sequential components Si on the basis of a transition relation de ned in the classical SOS style a la Plotkin Plo which we use to specify the behaviour of P by a Markov chain whose transitions st...

@article{gdp:lcf-as-pl, author={Plotkin, G. D.}, title={LCF Considered as a Programming Language}, journal={Theoretical Computer Science}, pages={223--255}, year=1977 } Summary: Plotkin investigates the relation between the denotational and the operational semantics of a programming language. As a working example, he picks PCF a language based on Scott’s Logic of Computable Functions. He demons...

@article{gdp:lcf-as-pl, author={Plotkin, G. D.}, title={LCF Considered as a Programming Language}, journal={Theoretical Computer Science}, pages={223--255}, year=1977 } Summary: Plotkin investigates the relation between the denotational and the operational semantics of a programming language. As a working example, he picks PCF a language based on Scott’s Logic of Computable Functions. He demons...

We construct a hierarchy of semantics by successive abstract interpretations. Starting from the maximal trace semantics of a transition system, we derive the big-step semantics, termination and nontermination semantics, Plotkin’s natural, Smyth’s demoniac and Hoare’s angelic relational semantics and equivalent nondeterministic denotational semantics (with alternative powerdomains to the Egli-Mi...

Circus specifications define both data and behavioural aspects of systems using a combination of Z and CSP. Previously, a denotational semantics has been given to Circus; however, as a shallow embedding of Circus in Z, it was not possible to use it to prove properties like the refinement laws that justify the distinguishing development technique associated with Circus. This work presents a fina...

We aim to build a denotational semantics for the functional logic programming language Curry, to be used for parametricity and logical relation arguments. First, we investigate only a subset of Curry, but include the important features that separate Curry from a just functional language. We compare a poweralgebraic and a multialgebraic semantic approach and motivate our decision for the multial...

analysis is nite, which was not the case in our previous proposal [13]. The overheadneeded for reaching an improved precision essentially consists in the use of observability andkernel constraints and of their success and failure conditions.We can now consider the already mentioned paper [11]. A big di erence arises lookingfor instance at the way they handle clause composition a...

The theory of domains was established in order to have appropriate spaces on which to define semantic functions for the denotational approach to programming-language semantics. There were two needs: first, there had to be spaces of several different types available to mirror both the type distinctions in the languages and also to allow for different kinds of semantical constructs especially in ...