Formalizing Giles Gardam's Disproof of Kaplansky's Unit Conjecture
Offered By: ACM SIGPLAN via YouTube
Course Description
Overview
Explore a conference talk detailing the formalization of Giles Gardam's disproof of Kaplansky's Unit Conjecture using Lean 4. Delve into the combination of deductive proving and formally verified computation, showcasing the capabilities of Lean 4 as both a programming language and proof assistant. Discover how the speakers demonstrate real-time formalization of a significant mathematical result and the seamless integration of proofs and computations. Gain insights into the current state of the art in formal verification and its practical applications in mathematical research.
Syllabus
[CPP'24] Formalizing Giles Gardam's Disproof of Kaplansky's Unit Conjecture
Taught by
ACM SIGPLAN
Related Courses
SPARK 2014AdaCore via Independent Automated Reasoning: Symbolic Model Checking
EIT Digital via Coursera Software Testing and Verification
University System of Maryland via edX Haskell for Imperative Programmers
YouTube Model Checking and Temporal Logic - E. Allen Emerson's Turing Award Lecture
Association for Computing Machinery (ACM) via YouTube