A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures (Q2946743): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:16, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures |
scientific article |
Statements
A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures (English)
0 references
17 September 2015
0 references
KIV
0 references
Z
0 references
concurrent access
0 references
linearizability
0 references
nonatomic refinement
0 references
theorem proving
0 references
