Quasi-Linearizability is Undecidable

DOI10.1007/978-3-319-26529-2_20zbMath1329.68187OpenAlexW2295899001MaRDI QIDQ3459426

Yi Lv, Chao Wang, Gaoang Liu, Peng Wu

Publication date: 8 January 2016

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-26529-2_20

Mathematics Subject Classification ID

Formal languages and automata (68Q45) 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 (1)

Decomposable Relaxation for Concurrent Data Structures

This page was built for publication: Quasi-Linearizability is Undecidable