Explaining relaxed memory models with program transformations

DOI10.1007/978-3-319-48989-6_29zbMath1427.68048OpenAlexW2550256838MaRDI QIDQ2281648

Viktor Vafeiadis, Ori Lahav

Publication date: 3 January 2020

Full work available at URL: http://hdl.handle.net/11858/00-001M-0000-002C-EBF9-6

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (4)

Parallelized sequential composition and hardware weak memory models ⋮ Unnamed Item ⋮ CCA-Secure Keyed-Fully Homomorphic Encryption ⋮ Overcoming memory weakness with unified fairness. Systematic verification of liveness in weak memory models

This page was built for publication: Explaining relaxed memory models with program transformations