A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures (Q2946743)

From MaRDI portal
Revision as of 22:23, 23 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures
scientific article

    Statements

    A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures (English)
    0 references
    0 references
    0 references
    0 references
    17 September 2015
    0 references
    KIV
    0 references
    Z
    0 references
    concurrent access
    0 references
    linearizability
    0 references
    nonatomic refinement
    0 references
    theorem proving
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references