A Game Semantics of the Asynchronous π-Calculus

Laird, Jim

doi:10.1007/11539452_8

Cited by 23 publications

(23 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally we shall mention a relation to the categorical semantics (and game semantics) of the πcalculus in [17,23]. The models in these work form traced closed Freyd categories, thus are instances of the structure considered in this paper.…”

Section: Relation To the Call-by-name Cps Translationmentioning

confidence: 99%

From Linear Logic to Cyclic Sharing

Hasegawa

2019

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

Section: Relation To the Call-by-name Cps Translationmentioning

confidence: 99%

From Linear Logic to Cyclic Sharing

Hasegawa

2019

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…By contrast, Ghica and Murawski [GM08] used an interleaved form of pointer games to model Idealized Concurrent Algol (ICA). Using a similar approach, Laird gave a game semantics for Idealized CSP [Lai01b] and later to the asynchronous π-calculus [Lai05b]. Finally, Melliès and Mimram combined the two approaches (interleaved and non-interleaved) in their work on asynchronous games [MM07].…”

Section: Concurrency In Game Semanticsmentioning

confidence: 99%

“…It has been used in game models for asynchronous languages [Lai01b,Lai05b,Lai06] and circuits [Fos07]. In particular, it is a formalisation of the definition that appears on [GM08].…”

Section: Definition 531 (Saturation Preordermentioning

confidence: 99%

On the Compositionality of Round Abstraction

Ghica

Menaa

2010

CONCUR 2010 - Concurrency Theory

View full text Add to dashboard Cite

Game Semantics is an approach to denotational semantics that has been successful in providing accurate, fully abstract models for various programming languages. It has thereafter been applied, amongst other things, to model checking, access control analysis, information flow analysis, and recently, hardware synthesis.While the roots of modern Game Semantics are sequential, several game models of asynchronous concurrency have since been devised. However, synchronous concurrency has not been considered hitherto.This thesis studies synchronous concurrency in game-like models. The central idea is to investigate deriving such synchronous models from their asynchronous counterparts using round abstraction-a technique that allows aggregating a sequence of computational steps to form a larger, more abstract macro-step.We define round abstraction within a trace-semantic setting that generalises game semantic models. We note that, in general, round abstraction is not compositional. We then identify sufficient conditions to guarantee correct composition, thereby proposing a framework for round abstraction that is sound when applied to synchronous and asynchronous behaviours.

show abstract

“…Reflecting the traditions of concurrency theory, game semantics for concurrent programs come in two styles: based on interleavings and on partial-orders. Of these, the historical focus has been on interleaving, giving models of various programming languages [1], [2], even a model-checking tool [3]. Partial-order methods have the strength of supporting reasoning about dependency directly, but are at a more preliminary stage.…”

Section: Introductionmentioning

confidence: 99%

Symmetry in concurrent games

Castellan

Clairambault

Winskel

2014

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Nin

View full text Add to dashboard Cite

Abstract-Behavioural symmetry is introduced into concurrent games. It expresses when plays are essentially the same. A characterization of strategies on games with symmetry is provided. This leads to a bicategory of strategies on games with symmetry. Symmetry helps allay the perhaps overly-concrete nature of games and strategies, and shares many mathematical features with homotopy. In the presence of symmetry we can consider monads for which the monad laws do not hold on the nose but do hold up to symmetry. This broadening of the concept of monad has a dramatic effect on the types concurrent games can support and allows us, for example, to recover the replication needed to express and extend traditional game semantics of programming languages.

show abstract

A Game Semantics of the Asynchronous π-Calculus

Cited by 23 publications

References 15 publications

From Linear Logic to Cyclic Sharing

From Linear Logic to Cyclic Sharing

On the Compositionality of Round Abstraction

Symmetry in concurrent games

Contact Info

Product

Resources

About