ABA problem
A correctness hazard in lock-free algorithms where a location read as value A is changed to B and back to A, so a compare-and-swap wrongly succeeds even though the underlying state changed in between.
grounded in: HN front-page theme 'Rust and the hard edges of systems concurrency' (systems concurrency pitfalls)
Connected concepts
Lock-free programming, Memory ordering
Explore it live in the knowledge graph →