Automatically verifying concurrent queue algorithms
From MaRDI portal
Recommendations
- Formal verification of a practical lock-free queue algorithm
- An integrated specification and verification technique for highly concurrent data structures
- Testing and verifying concurrent objects
- Checking linearizability of concurrent priority queues
- Safety and Liveness in Concurrent Pointer Programs
Cited in
(7)- Analysing lock-free linearizable datatypes using CSP
- Verifying concurrent data structures by simulation
- Verifying concurrent graph algorithms
- Automated verification of concurrent linked lists with counters
- Formal verification of the MCS list-based queueing lock
- An integrated specification and verification technique for highly concurrent data structures
- Formal verification of a practical lock-free queue algorithm
This page was built for publication: Automatically verifying concurrent queue algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2845500)