Verified Programming of Turing Machines in Coq
summary
Formal development in Coq of Turing machines and their programming, including definitions of machines, encodings, and correctness proofs. Uses Coq to verify that implemented Turing machine programs satisfy their specifications and to reason about computability and reductions within the Coq proof assistant.
AI-written summary · about
chapters (6)
- 0:00Verified Turing Machines in Coq
- 3:21Verification core concepts
- 8:08Case studies and apps
- 13:16Encoding overhead
- 16:13Future directions
- 20:51Conclusion & Q&A
related talks
13mSpoq: Scaling Machine-Checkable Systems Verification in Coq
42mMetaCoq as a tool to prevent future unsoundness in Coq
24mAn Intrinsically-typed Probabilistic Programming Language in Coq (Extended Abstr...
36mMcTT: Building A Correct-By-Construction Proof Checker For Martin-Loef Type Theory
31mA Coq Library of Undecidable Problems
24mCode Extraction from Coq to ML-like languages
01h 34mFormal Logic Undressed
19mExtensible Metatheory Mechanization via Family Polymorphism
