Formal verification's barrier is labor, not complexity — verified OS kernels already exist
jd_pressman · x · 2026-10-23
Responding to the claim that complex systems can't be formally verified, the author argues that's a stale intuition: academic formal verification methods and tooling have advanced steadily since it was abandoned as a general approach — it was just too labor-intensive to use.
Formally verified operating system kernels already exist and exercise essentially every computational primitive used in practice, suggesting complexity isn't the main barrier — labor is.
More from Research
- Varformer: multimodal transformer prioritizes drug targets from population-scale variation — anshulkundaje · 2026-10-23
- Koi Paper: Self-Calibrating Planner Boosts Heterogeneous LLM Fleet Goodput 1.18x, Cuts $/token 20% — burny_tech · 2026-10-23
- Fudan's Code2Video-Compass benchmarks 15 MLLMs on code-based video generation across 2,104 tasks — Fudan-University · 2026-10-23
- Kimi bets RL on a 3T base: trajectory volume beats model capacity, DeepSeek disagrees — teortaxesTex · 2026-10-23
- HCI Methods Chapter Now Compares Frequentist, Estimation and Bayesian Statistics Side by Side — IanArawjo · 2026-10-23
- OSI Hackathon winner Consilith: an open multiplayer studio where researchers and their AI agents collaborate on science — BenBlaiszik · 2026-10-23