Angelic Semantics of Fine-Grained Concurrency

Abstract

Abstract. We introduce a game model for a procedural programming language extended with primitives for parallel composition and synchronization on binary semaphores. The model uses an interleaved version of Hyland-Ong-style games, where most of the original combinatorial constraints on positions are replaced with a simple principle naturally related to static process creation. The model is fully abstract for mayequivalence.

On the Compositionality of Round Abstraction

“…Then, we introduce a category of interleaved asynchronous processes, in the style of Ghica and Murawski's concurrent game model [GM08]. We prove that partial round abstraction is compositional in both the causal and asynchronous settings.…”

“…Several asynchronous concurrent game models have subsequently appeared in the literature, e.g. [Lai01b,Lai06,GM08]; but no synchronous homologue as yet.…”

“…New alternative formulations of copycat and asynchronous identities are introduced alongside new categorical proofs, cf. [GM08].…”

Compositional Model Extraction for Higher-Order Concurrent Programs

“…In this paper we substantially expand the expressivity of the programming language we model, by adding higher-order procedures, sharedvariable concurrency and semaphores. The immediately relevant theoretical developments which led to this new model checking technique are a game model for shared-variable concurrency [12] and a type system used to identify decidable terms in the language [19].…”

“…The framework proved to be very useful for constructing semantics for a variety of programming languages involving diverse computational features such as state [10], control [11], concurrency [12] and more. The first steps in the direction of application of game semantics for program analysis were taken by Hankin and Malacaria [13].…”