POPL PC workshop

Add to your list(s) Download to your calendar using vCal

• Speaker to be confirmed
• Tuesday 01 October 2013, 09:30-17:00
• LT1.

If you have a question about this talk, please contact Peter Sewell.

NOTE CHANGED SCHEDULE

9.30 Andrey Rybalchenko, Program Verification by Solving (Quantified) Horn Clauses
10.00 GAP
10.30-11.00 break,
11.00 Xavier Rival, Modular Construction of Shape-Numeric Analyzers
11.30 Nate Foster, NetKAT: Semantic Foundations for Networks
12.00 Mads Dam, Routing and location independence in object network overlays
12.30-2.00 break
2.00 Alan Jeffrey, Functional Reactive Programming via the isomorphism between relations and set-valued functions
2.30 Neelakantan Krishnaswami, FRP without spacetime leaks
3.00 Ross Tate, Redesigning Industry OO Type Systems
3.30-4.00 break
4.00 Andrew Appel, Program Logics for Certified Compilers
4.30 Viktor Vafeiadis, Relaxed Separation Logic

This talk is part of the Semantics Lunch (Computer Laboratory) series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge talks
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• LT1
• School of Technology
• Semantics Lunch (Computer Laboratory)
• Trust & Technology Initiative - interesting events
• bld31
• yk373's list

Note that ex-directory lists are not shown.