Using refinement calculus techniques to prove linearizability
type: Item
instance of: scholarly article
title: Using refinement calculus techniques to prove linearizability
zbMATH Open document ID: 1259.68128
author: Bengt Jonsson
published in: Formal Aspects of Computing
publication date: 2013-03-22T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68N30
zbMATH DE Number: 6148337
zbMATH Keywords: refinement calculus
zbMATH Keywords: multi-threading
zbMATH Keywords: formal verification
zbMATH Keywords: linearizability
describes a project that uses: UNITY
MaRDI profile type: Publication
full work available at URL: s00165-012-0250-7
OpenAlex ID: W2048605787
cites work: A calculus of refinements for program derivations
cites work: Verification, Model Checking, and Abstract Interpretation
cites work: Stepwise refinement of parallel algorithms
cites work: Q4692502
cites work: Simplifying Linearizability Proofs with Reduction and Abstraction
cites work: Q3639041
cites work: A theorem on atomicity in distributed algorithms
cites work: Reduction
cites work: Q3996918
DOI: 10.1007/S00165-012-0250-7
description: scientific article; zbMATH DE number 6148337