Incremental Proof Development in Dafny with Module-Based Induction
Offered By: ACM SIGPLAN via YouTube
Course Description
Overview
Explore a 16-minute conference talk from ACM SIGPLAN that delves into improving proof stability and maintainability in Dafny using module-based induction. Learn how to overcome the challenges of highly automated theorem provers by implementing Coq-like induction principles for inductive data structures. Discover techniques to enhance control over proof search, reduce unpredictable verification times, and avoid hard-to-diagnose proof failures. Gain insights into creating more robust and manageable proofs, particularly when dealing with complex inductive properties in Dafny.
Syllabus
[Dafny'24] Incremental Proof Development in Dafny with Module-Based Induction
Taught by
ACM SIGPLAN
Related Courses
Teaching Logic and Set Theory with DafnyACM SIGPLAN via YouTube CLOVER: Closed-Loop Verifiable Code Generation - Dafny'24
ACM SIGPLAN via YouTube Verifying a Concurrent File System with Sequential Reasoning
ACM SIGPLAN via YouTube Generating Conforming Programs with Xsmith
ACM SIGPLAN via YouTube Domesticating Automation for Large-Scale Verification Systems - Dafny'24
ACM SIGPLAN via YouTube