Elucidating concurrent algorithms via layers of abstraction and reification (Q539423): 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: 68N19 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68N99 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5900835 / rank
 
Normal rank
Property / zbMATH Keywords
 
formal methods
Property / zbMATH Keywords: formal methods / rank
 
Normal rank
Property / zbMATH Keywords
 
concurrency
Property / zbMATH Keywords: concurrency / rank
 
Normal rank
Property / zbMATH Keywords
 
program proof
Property / zbMATH Keywords: program proof / rank
 
Normal rank
Property / zbMATH Keywords
 
rely/guarantee conditions
Property / zbMATH Keywords: rely/guarantee conditions / rank
 
Normal rank
Property / zbMATH Keywords
 
asynchronous communication mechanisms
Property / zbMATH Keywords: asynchronous communication mechanisms / rank
 
Normal rank
Property / zbMATH Keywords
 
Simpson's algorithm
Property / zbMATH Keywords: Simpson's algorithm / rank
 
Normal rank

Revision as of 10:50, 1 July 2023

scientific article
Language Label Description Also known as
English
Elucidating concurrent algorithms via layers of abstraction and reification
scientific article

    Statements

    Elucidating concurrent algorithms via layers of abstraction and reification (English)
    0 references
    0 references
    0 references
    30 May 2011
    0 references
    formal methods
    0 references
    concurrency
    0 references
    program proof
    0 references
    rely/guarantee conditions
    0 references
    asynchronous communication mechanisms
    0 references
    Simpson's algorithm
    0 references

    Identifiers