~/talk

Proving and Disproving Equivalence of Functional Programming Assignments

Talkat PLDI 2023 · 2023-06-17..06-21
links:none on file
links:none on file
slides:none on file

A tool implemented on top of the Stainless verifier automatically proves or disproves student Scala submissions by generating inductive equivalence proofs or concrete counterexamples, evaluating over 4,000 programs from real courses and 17 literature pairs, with 86% overall classification success and ≈99% success on incorrect programs. It handles recursion via functional induction, aligns helpers with function call matching, and scales across hundreds of submissions using clustering leveraging transitivity to discover intermediate reference solutions.

AI-written summary · about

  1. 0:00Equivalence checking intro
  2. 1:47Why formal verification matters
  3. 3:32Approach overview
  4. 4:13Induction for equivalence
  5. 5:59Function matching
  6. 8:11Clustering submissions
  7. 9:35Evaluation on benchmarks
  8. 12:42Related work and implementation
  9. 13:23Conclusion and effectiveness
  10. 14:08Q&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.