Hazard pointers: safe memory reclamation for lock-free objects

By Maged M. Michael. IEEE Transactions on Parallel and Distributed Systems, 2004

539 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Hardware and Architecture

View Paper: https://www.semanticscholar.org/paper/e7a2f4f2b5d6f8d160cc381f2b6b0a36f2e8081c

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Cristiano Calcagno
2. Peter W. O'Hearn
3. Josh Berdine
4. Matthew J. Parkinson
5. S. Brookes
6. Viktor Vafeiadis
7. Hongseok Yang

In Hardware and Architecture

1. Peter W. O'Hearn
2. Josh Berdine
3. Cristiano Calcagno

Citations in the corpus

• Resources, Concurrency and Local Reasoning (2004, background): “Another would be to reason about the extremely subtle non-blocking algorithms which allow races but recover from them rather than prohibiting them (e.g. [ 30 ]).”
• Smallfoot: Modular Automatic Assertion Checking with Separation Logic (2005, background): “An example of this is Parkinson and Bornat's proof [34] of the non-blocking stack of Michael [26].”