Analysing lock-free linearizable datatypes using CSP
From MaRDI portal
Publication:1708716
DOI10.1007/978-3-319-51046-0_9zbMath1485.68153OpenAlexW2561986775MaRDI QIDQ1708716
Publication date: 26 March 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-51046-0_9
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 (max. 100)
Checking opacity and durable opacity with FDR ⋮ View abstraction for systems with component identities
This page was built for publication: Analysing lock-free linearizable datatypes using CSP