Following Claude Code creator Boris Cherny's comment that the Opus model used TLA+ to detect race conditions, online discussion has surged around formal verification as a fix for agentic software bugs. A longtime TLA+ educator and advocate argues this enthusiasm is overblown, noting that formal verification only checks properties that engineers explicitly define, and many important properties can't even be expressed in TLA+.
buttondown.com
· 2026-09-30
An interactive tutorial walks through TLA+, a formal specification language used to describe transition systems and verify their properties. It illustrates core concepts like states, actions, safety and liveness properties using a leader-election example among three computers, showing how a model checker can explore all possible states and surface counterexamples when rules are violated.
reasonable.io
· 2026-09-27
A systems researcher shares an in-progress investigation into building a compositional theory of self-stabilization, using a TLA+ model of a retry storm to study how distributed components' guarantees can break down under large shocks. Finding no recent progress on composing self-stabilizing systems since early-2000s layered stabilization work, they turned to a 2017 control theory paper by Kim, Arcak and Seshia on parametric assume-guarantee contracts, which offers a way to reason about circular dependencies between components without stabilization layering.
muratbuffalo.blogspot.com
· 2026-09-21
A formal-methods writer argues that computer science conflates two distinct concepts under the single word 'abstraction.' One is 'modularity abstraction'—the traditional CS practice of hiding implementation details behind interfaces, APIs, and layered designs. The other is 'modeling abstraction,' used in tools like TLA+, which strips a system down to the minimal behavioral core needed to reason about a specific property, cutting across layers rather than hiding them.
muratbuffalo.blogspot.com
· 2026-09-02