Explanation of two non-blocking shared-variable communication algorithms (Q469352)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Explanation of two non-blocking shared-variable communication algorithms |
scientific article; zbMATH DE number 6367490
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Explanation of two non-blocking shared-variable communication algorithms |
scientific article; zbMATH DE number 6367490 |
Statements
Explanation of two non-blocking shared-variable communication algorithms (English)
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
0 references
0.7806364297866821
0 references
0.7477931976318359
0 references
0.7406371831893921
0 references
0.71816086769104
0 references
0.7147713899612427
0 references
