Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
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.
