~/talk

Improving the Stability of Type Safety Proofs in Dafny

Talkat Dafny 2024 · on Sunday, 2024-01-14
links:none on file
links:none on file
slides:none on file

Presents a concrete method for stabilizing Dafny type-soundness proofs by making the safety predicate and then the typechecker opaque, proving small safety lemmas and inversion lemmas instead of unfolding huge defs. Applies to a Cedar-style language and completes the full soundness proof; experiments run 500 verifications show mean resource use drops and variance falls (coefficient of variation for opaque proofs < 0.2 vs > 0.2 for direct proofs, resources measured in millions). The approach noticeably improves Z3/Dafny verification stability.

AI-written summary · about

  1. 0:00Introduction
  2. 0:46Proving type soundness in Dafny
  3. 5:21Instability of direct proofs
  4. 6:24Seeking robust solution
  5. 7:49Making safety property opaque
  6. 9:14Leveraging induction
  7. 10:36Making type checker opaque
  8. 11:19Improved proof outcome
  9. 12:00Proof stability results
  10. 14:10Q&A
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.