Bounded TSO-to-SC Linearizability Is Decidable

DOI10.1007/978-3-662-49192-8_33zbMath1442.68153OpenAlexW2406588521MaRDI QIDQ2794380

Yi Lv, Peng Wu, Chao Wang

Publication date: 10 March 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49192-8_33

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Information storage and retrieval of data (68P20)

Related Items (1)

TSO-to-TSO linearizability is undecidable

This page was built for publication: Bounded TSO-to-SC Linearizability Is Decidable