Modular verification of concurrency-aware linearizability

DOI10.1007/978-3-662-48653-5_25zbMath1394.68229OpenAlexW2293847997MaRDI QIDQ1664150

Viktor Vafeiadis, Nir Hemed, Noam Rinetzky

Publication date: 24 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-662-48653-5_25

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 (5)

Tasks in modular proofs of concurrent algorithms ⋮ Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity ⋮ Proving Linearizability Using Partial Orders ⋮ Unnamed Item ⋮ Relaxed data types as consistency conditions

This page was built for publication: Modular verification of concurrency-aware linearizability