Tournaments for mutual exclusion: verification and concurrent complexity
From MaRDI portal
(Redirected from Publication:1682286)
Recommendations
Cites work
- A new solution of Dijkstra's concurrent programming problem
- An axiomatic proof technique for parallel programs
- Arbitration without common modifiable variables
- Correctness and concurrent complexity of the black-white bakery algorithm
- scientific article; zbMATH DE number 1639446 (Why is no real title available?)
- scientific article; zbMATH DE number 194539 (Why is no real title available?)
- Myths about the mutual exclusion problem
- Progress under bounded fairness
- The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms
- The mutual exclusion problem
- The Rely-Guarantee method for verifying shared variable concurrent programs
- Verification of sequential and concurrent programs
This page was built for publication: Tournaments for mutual exclusion: verification and concurrent complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1682286)