Reasoning Algebraically About Refinement on TSO Architectures

DOI10.1007/978-3-319-10882-7_10zbMath1432.68006OpenAlexW1532883852MaRDI QIDQ2938158

John Derrick, Graeme Smith, Brijesh Dongol

Publication date: 13 January 2015

Published in: Theoretical Aspects of Computing – ICTAC 2014 (Search for Journal in Brave)

Full work available at URL: http://eprints.whiterose.ac.uk/113097/1/main.pdf

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

TSO-to-TSO linearizability is undecidable ⋮ Making Linearizability Compositional for Partially Ordered Executions ⋮ Linearizability on hardware weak memory models

This page was built for publication: Reasoning Algebraically About Refinement on TSO Architectures