Explanation of two non-blocking shared-variable communication algorithms (Q469352): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68N30 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q60 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6367490 / rank
 
Normal rank
Property / zbMATH Keywords
 
separation logic
Property / zbMATH Keywords: separation logic / rank
 
Normal rank
Property / zbMATH Keywords
 
rely-guarantee
Property / zbMATH Keywords: rely-guarantee / rank
 
Normal rank
Property / zbMATH Keywords
 
concurrency
Property / zbMATH Keywords: concurrency / rank
 
Normal rank
Property / zbMATH Keywords
 
proof
Property / zbMATH Keywords: proof / rank
 
Normal rank
Property / zbMATH Keywords
 
refinement
Property / zbMATH Keywords: refinement / rank
 
Normal rank
Property / zbMATH Keywords
 
atomicity
Property / zbMATH Keywords: atomicity / rank
 
Normal rank

Revision as of 17:13, 30 June 2023

scientific article
Language Label Description Also known as
English
Explanation of two non-blocking shared-variable communication algorithms
scientific article

    Statements

    Explanation of two non-blocking shared-variable communication algorithms (English)
    0 references
    0 references
    0 references
    10 November 2014
    0 references
    separation logic
    0 references
    rely-guarantee
    0 references
    concurrency
    0 references
    proof
    0 references
    refinement
    0 references
    atomicity
    0 references

    Identifiers