A blog post describes an experimental approach to memory safety checking in the Vale programming language, which scans function code in reverse order to detect use-after-free errors. The algorithm tracks variable usage, mutation, and declaration events as it walks backward through desugared code, flagging cases where a mutation could invalidate a pending reference. The author presents this as a novel technique and explicitly asks readers to review it for flaws.
verdagon.dev
· 2026-10-18
A reply-post analyzing a reader's use-after-free bug in a limit-order matching engine argues that object pools change the nature of memory bugs rather than eliminating them. The author explains that without pooling, a freed-and-reused memory slot can let two different object types collide, potentially turning a stale pointer into a code-execution exploit via a mismatched function pointer. With pooling, the same logical use-after-free persists, but because the recycled memory always holds the same type, the dangerous type confusion is avoided—unless the object itself contains an inline tagged union, which reopens the original hazard.
matklad.github.io
· 2026-09-02
GoKawiil