Sun 14 Jan 2024 14:54 - 15:12 at Turing Lecture - Proof Stability / Brittleness / Scale Chair(s): Stefan Zetzsche
Brittleness in verification describes the phenomenon where seemingly inconsequential changes to a program being verified, or to the verification tools, cause the outcome of verification to change. Using multiple SMT solvers mitigates proof brittleness and improves verification performance. When implemented in the cloud it provides multi-developer team consistency. While it can introduce new challenges such as soundness concerns, energy use, and network congestion, those can be mitigated. We believe it is the right default for many Dafny use cases, especially on large codebases with more than one developer.
Sun 14 JanDisplayed time zone: London change
Sun 14 Jan
Displayed time zone: London change
14:00 - 15:30 | Proof Stability / Brittleness / ScaleDafny at Turing Lecture Chair(s): Stefan Zetzsche Amazon Web Services | ||
14:00 18mTalk | Enhancing Proof Stability Dafny Sean McLaughlin Amazon Web Services, Georges-Axel Jaloyan Amazon Web Services, Tongtong Xiang Amazon Web Services, Florian Rabe Amazon Web Services | ||
14:18 18mTalk | Improving the Stability of Type Safety Proofs in Dafny Dafny Joseph W. Cutler University of Pennsylvania, Michael Hicks Amazon Web Services and the University of Maryland, Emina Torlak Amazon Web Services, USA | ||
14:36 18mTalk | Incremental Proof Development in Dafny with Module-Based Induction Dafny | ||
14:54 18mTalk | Portfolio Solving for Dafny Dafny Eric Mugnier University of California San Diego, Sean McLaughlin Amazon Web Services, Aaron Tomb Amazon Web Services | ||
15:12 18mTalk | Domesticating Automation Dafny Pranav Srinivasan University of Michigan / VMware Research, Oded Padon VMware Research, Jon Howell VMware Research, Andrea Lattuada VMware Research |