Rely-guarantee bound analysis of parameterized concurrent shared-memory programs. With an application to proving that non-blocking algorithms are bounded lock-free (Q2058383)
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: Rely-guarantee bound analysis of parameterized concurrent shared-memory programs. With an application to proving that non-blocking algorithms are bounded lock-free |
scientific article; zbMATH DE number 7440324
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Rely-guarantee bound analysis of parameterized concurrent shared-memory programs. With an application to proving that non-blocking algorithms are bounded lock-free |
scientific article; zbMATH DE number 7440324 |
Statements
Rely-guarantee bound analysis of parameterized concurrent shared-memory programs. With an application to proving that non-blocking algorithms are bounded lock-free (English)
0 references
8 December 2021
0 references
complexity and resource bound analysis
0 references
rely-guarantee reasoning
0 references
lock-free data structures
0 references
0 references
0 references
0 references
0 references
