Since it seems on topic, I link a related project by an undergraduate at the University of Bologna https://saveriogiallorenzo.com/publications/sac2025a/sac2025a

Since it seems on topic, I link a related project by an undergraduate at the University of Bologna https://saveriogiallorenzo.com/publications/sac2025a/sac2025a.pdf https://saveriogiallorenzo.com/publications/sac2025a/sac2025... Essentially, it’s a refinement of Bacon-Rajan’s cycle collector (sequential) that does not require auxiliary heap memory and handles failures when tracing complex object graphs because it uses a breadth-first technique that fundamentally prevents stack overflow scenarios. What's particularly compelling is the Rust implementation, which weaves the type system and borrow checker into the algorithm's design. When dealing with garbage cycles, the algorithm doesn't just match current Rust GC alternatives, it outperforms them.