An update on the Knuckledragger theorem prover project, covering kernel changes, AI experiments, symbolic union, and future development plans.
Explores the impossibility of achieving common knowledge for coordinated attack in asynchronous distributed systems, based on Halpern and Moses' 1990 paper.
Discusses the importance of validating AI and automated systems, covering methods like consistency checks, certificates, and formal verification.
Introducing a Lean-like syntax parser for the Knuckledragger theorem prover to improve formula readability over verbose Python/Z3Py syntax.
AI is predicted to bring formal verification tools like Dafny and Verus into mainstream use, aided by LLMs making them more accessible.
Explores categorical models for dependent type theory, connecting lambda calculus to fibrations and sections in locally cartesian closed categories.
An introduction to Lean, a programming language for formalizing mathematics, using a simple proof of 2=2 as an example.
MongoDB engineers explain how they test their distributed system implementations against formal TLA+ specifications to ensure correctness.
Explains a neuro-symbolic system using a theorem prover to prevent GenAI hallucinations in enterprise actions, ensuring logical constraints are met.
Analyzing the effectiveness of tools like YARPGen in exploring state space for finding missed alarm bugs in formal verification.
A critique arguing that testing is essential for complex systems, countering the claim that informal reasoning is superior.
