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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
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
Property / cites work
 
Property / cites work: MASCOT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relational separation logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inter-process buffers in separation logic with rely-guarantee / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4797824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5549763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5563096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process synchronisation in MASCOT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4808839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting Atoms with Rely/Guarantee Conditions Coupled with Data Reification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elucidating concurrent algorithms via layers of abstraction and reification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resources, concurrency, and local reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramifications of metastability in bit variables explored via Simpson's 4-slot mechanism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular Safety Checking for Fine-Grained Concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Marriage of Rely/Guarantee and Separation Logic / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MASCOT / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00165-011-0213-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2028010419 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:15, 9 July 2024

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