Verifying a Quantitative Relaxation of Linearizability via Refinement
Concurrent data structures have found increasingly widespread use in both multicore and distributed computing environments, thereby escalating the priority for verifying their correctness. The thread safe behavior of these concurrent objects is often described using formal semantics known as lineari...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
Virginia Tech
2013
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10919/23222 |