A Denotational Semantics for SPARC TSO

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...

Full description

Saved in:

Bibliographic Details
Published in:	Logical methods in computer science Vol. 15, Issue 2
Main Authors:	Kavanagh, Ryan, Brookes, Stephen
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science e.V 01.01.2019
Subjects:	computer science - programming languages f.3.2
ISSN:	1860-5974, 1860-5974
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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.
ISSN:	1860-5974 1860-5974
DOI:	10.23638/LMCS-15(2:10)2019