TSO-to-TSO Linearizability Is Undecidable

DOI10.1007/978-3-319-24953-7_24zbMath1408.68103OpenAlexW2404293746MaRDI QIDQ3460573

Yi Lv, Chao Wang, Peng Wu

Publication date: 8 January 2016

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-24953-7_24

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

TSO-to-TSO linearizability is undecidable ⋮ Decidability of liveness for concurrent objects on the TSO memory model

This page was built for publication: TSO-to-TSO Linearizability Is Undecidable