When TLA+ Fits and Alloy Demo

Formal methods with Hillel Wayne

Topic 11 of 17

Published Jul 29, 2026 · Clip 50:17–58:46 (8:29)

Hillel explains TLA+ and formal methods shine in highly computational, technical domains (databases, cloud, hardware) removed from business-embedded human behavior. TLA+ is good for discrete distributed systems with concurrency challenges but can't do floating point, decimals, or probabilistic reasoning, and is wasted if you can iterate cheaply and bugs aren't costly. He demos Alloy on an access-control system with parent-child resources and shows a counterexample visualization: readable-by is not transitive, so a user can read a child but not a grandchild. He also explains SAT solving (Boolean satisfiability, NP-complete but fast in practice) and why Alloy models check in milliseconds while large TLA+ models churn overnight.