Wait-free linearization with an assertional proof
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 50008 (Why is no real title available?)
- scientific article; zbMATH DE number 194539 (Why is no real title available?)
- An axiomatic proof technique for parallel programs
- Impossibility of distributed consensus with one faulty process
- On-the-fly garbage collection for several mutators
- The Hoare logic of concurrent programs
- The ``Hoare Logic of CSP, and All That
Cited in
(7)- Wait-free linearization with a mechanical proof
- A simple constructive computability theorem for wait-free computation
- Bounded delay for a free address
- A Single-Enqueuer Wait-Free Queue Implementation
- Universal constructions that ensure disjoint-access parallelism and wait-freedom
- Proving a non-blocking algorithm for process renaming with TLA\textsuperscript{+}
- Making objects writable
This page was built for publication: Wait-free linearization with an assertional proof
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136979)