This is a discussion of garbage collection of Unix domain sockets in the Linux kernel. (i.e. `AF_UNIX`, and btw, AF is short for "address family").

It is talking about replacing a classic mark/sweep collector for unix domain sockets by something based on Tarjan's Strongly Connected Components.

Thank you for the clarification. I guess authors these days assume they don't need to state the Unix flavour they're talking about.

I think this is a good example of complex lifetimes involving reference cycles that can not be safely modeled by eg. Rust.

Is the next step formal methods (theorem proving) or is there a less complex lifetime system still out there that could model this?