Concurrent Separation Logic Meets Template Games

Melliès, Paul-André; Stefanesco, Léo

doi:10.1145/3373718.3394762

Cited by 6 publications

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…5] for a review within the context of categorical rewriting theory). Remarkable examples include the category of asynchronous graphs as introduced in [55], which permit to model certain structures in game semantics, and various notions of attributed and symbolic graphs as discussed in [54]. Many other examples concern comma category constructions, with a number of illustrative examples provided in Table 1.…”

Section: Many Of the Examples Listed Inmentioning

confidence: 99%

Fundamentals of Compositional Rewriting Theory

Behr¹,

Harmer²,

Krivine³

2022

Preprint

View full text Add to dashboard Cite

A foundational theory of compositional categorical rewriting theory is presented, based on a collection of fibrationlike properties that collectively induce and structure intrinsically the large collection of lemmata used in the proofs of theorems such as concurrency and associativity. The resulting highly generic proofs of these theorems are given; it is noteworthy that the proof of the concurrency theorem takes only a few lines and, while that of associativity remains somewhat longer, it would be unreadably long if written directly in terms of the basic lemmata. In addition to improving, or even enabling, the readability of human-written proofs, we anticipate that this more generic and modular style of writing proofs should organize and inform the production of formalized proofs in a proof assistant such as Coq or Isabelle. A curated list of known instances of our framework is used to conclude the paper with a detailed discussion of the conditions under which the Double Pushout and Sesqui-Pushout semantics of graph transformation are compositional.

show abstract

Section: Many Of the Examples Listed Inmentioning

confidence: 99%

Fundamentals of Compositional Rewriting Theory

Behr¹,

Harmer²,

Krivine³

2022

Preprint

View full text Add to dashboard Cite

show abstract

Fundamentals of compositional rewriting theory

Behr

Harmer

Krivine

2023

Journal of Logical and Algebraic Methods in Programming

View full text Add to dashboard Cite

Layered and object-based game semantics

Vale

Melliès

Shao

et al. 2022

Proc. ACM Program. Lang.

Self Cite

View full text Add to dashboard Cite

Large-scale software verification relies critically on the use of compositional languages, semantic models, specifications, and verification techniques. Recent work on certified abstraction layers synthesizes game semantics, the refinement calculus, and algebraic effects to enable the composition of heterogeneous components into larger certified systems. However, in existing models of certified abstraction layers, compositionality is restricted by the lack of encapsulation of state. In this paper, we present a novel game model for certified abstraction layers where the semantics of layer interfaces and implementations are defined solely based on their observable behaviors. Our key idea is to leverage Reddy's pioneer work on modeling the semantics of imperative languages not as functions on global states but as objects with their observable behaviors. We show that a layer interface can be modeled as an object type (i.e., a layer signature) plus an object strategy. A layer implementation is then essentially a regular map, in the sense of Reddy, from an object with the underlay signature to that with the overlay signature. A layer implementation is certified when its composition with the underlay object strategy implements the overlay object strategy. We also describe an extension that allows for non-determinism in layer interfaces. After formulating layer implementations as regular maps between object spaces, we move to concurrency and design a notion of concurrent object space, where sequential traces may be identified modulo permutation of independent operations. We show how to express protected shared object concurrency, and a ticket lock implementation, in a simple model based on regular maps between concurrent object spaces.

show abstract

Concurrent Separation Logic Meets Template Games

Cited by 6 publications

References 16 publications

Fundamentals of Compositional Rewriting Theory

Fundamentals of Compositional Rewriting Theory

Fundamentals of compositional rewriting theory

Layered and object-based game semantics

Contact Info

Product

Resources

About