Bounded TSO-to-SC linearizability is decidable

DOI10.1007/978-3-662-49192-8_33MaRDI QIDQ2794380zbMATH OpenOpenAlexFDO

Authors Chao Wang, Yi Lv, Peng Wu

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

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

Recommendations

• TSO-to-TSO linearizability is undecidable
• TSO-to-TSO linearizability is undecidable
• Context-bounded analysis of TSO systems
• Quasi-linearizability is undecidable
• Concurrent Library Correctness on the TSO Memory Model

Cited in

(5)

• TSO-to-TSO linearizability is undecidable
• Quasi-linearizability is undecidable
• TSO-to-TSO linearizability is undecidable
• Context-bounded analysis of TSO systems
• Decidability of liveness for concurrent objects on the TSO memory model

This page was built for publication: Bounded TSO-to-SC linearizability is decidable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2794380)