Sun 14 Jan 2024 14:00 - 14:18 at Turing Lecture - Proof Stability / Brittleness / Scale Chair(s): Stefan Zetzsche
Dafny automates verification using an SMT solver. While this works well for many use cases, this automation is one source of proof brittleness. We informally call a proof brittle when it verifies on one version of Dafny but stops verifying when we make non-logical changes such as updating software versions or making changes to unrelated locations in the code. In this abstract we define a mode of use of Dafny called Dafny64 that dramatically reduces the resources needed for Dafny verification. We predict that Dafny64 will remove brittleness entirely from our projects.
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 |