A Denotational Semantics for SPARC TSO

11/02/2017
by   Ryan Kavanagh, et al.
0

The SPARC TSO weak memory model is defined axiomatically, with a non-compositional formulation that makes modular reasoning about programs difficult. Our denotational approach uses pomsets to provide a compositional semantics capturing exactly the behaviours permitted by SPARC TSO. It uses buffered states and an inductive definition of execution to assign an input-output meaning to pomsets. We show that our denotational account is sound and complete relative to the axiomatic account, that is, that it captures exactly the behaviours permitted by the axiomatic account. Our compositional approach facilitates the study of SPARC TSO and supports modular analysis of program behaviour.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/04/2000

Minimum Description Length and Compositionality

We present a non-vacuous definition of compositionality. It is based on ...
research
11/22/2018

Verifying C11 Programs Operationally

This paper develops an operational semantics for a release-acquire fragm...
research
06/24/2019

Automatic verification of heap-manipulating programs

Theoretical foundations of compositional reasoning about heaps in impera...
research
01/14/2020

Gillian: Compositional Symbolic Execution for All

We present Gillian, a language-independent framework for the development...
research
06/15/2023

Modularity Trumps Invariance for Compositional Robustness

By default neural networks are not robust to changes in data distributio...
research
03/22/2018

The Epistemology of Nondeterminism

This paper proposes new semantics for nondeterministic program execution...
research
04/11/2018

A denotational account of C11-style memory

We introduce a denotational semantic framework for shared-memory concurr...

Please sign up or login with your details

Forgot password? Click here to reset