scientific article
From MaRDI portal
Publication:2863833
zbMath1276.68062MaRDI QIDQ2863833
Lindsay Groves, Robert J. Colvin, Simon Doherty
Publication date: 4 December 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066105050929?np=y
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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) Data structures (68P05)
Related Items
A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures ⋮ A fine-grained semantics for arrays and pointers under weak memory models ⋮ Towards formally specifying and verifying transactional memory ⋮ Proving linearizability with temporal logic
This page was built for publication:
