Hi everyone,
We will having a PL seminar this Wednesday Jun 24 at 1 pm. Azadeh Farzan from the University of Toronto will be joining us to present her work on
Reductions for Safety Proof Simplification.
Abstract:
Program reductions are used widely to simplify reasoning about the correctness of concurrent and distributed programs. In this talk, I will present a general approach to proof simplification of concurrent/distributed programs based on exploring generic
classes of reductions. The main goal of reductions are to find a sound proof within the means automated verification tools when a full classic proof of the full program is strictly out of reach. I will introduce three (incrementally more expressive) classes
of sound program reductions, discuss their theoretical properties, show how they can be effectively used in algorithmic verification, and demonstrate that they are very effective in producing proofs of a diverse class of programs without targeting specific
syntactic properties of these programs.
We'll send out another reminder later this week.
Thanks,
John
Topic: madPL seminar
Time: This is a recurring meeting Meet anytime
Join Zoom Meeting
Meeting ID: 859 451 761
One tap mobile
+19292056099,,859451761# US (New York)
+13017158592,,859451761# US (Germantown)
Dial by your location
+1 929 205 6099 US (New York)
+1 301 715 8592 US (Germantown)
+1 312 626 6799 US (Chicago)
+1 669 900 6833 US (San Jose)
+1 253 215 8782 US (Tacoma)
+1 346 248 7799 US (Houston)
Meeting ID: 859 451 761