| 8:50 - 9:00 |
OPENING REMARKS |
PLMW Organizers |
| 9:00 - 9:30 |
You and your graduate research |
Nate Foster (Cornell University) |
| 9:30 - 10:00 |
Building automatic program verifiers |
Peter Müller (ETH Zürich) |
| 10:00 - 10:30 |
Proof theory and its role in programming language research |
Frank Pfenning (Carnegie Mellon University) |
| 10:30 - 11:00 |
COFFEE BREAK |
|
| 11:00 - 11:30 |
How to write a good research paper |
Stephanie Weirich (University of Pennsylvania) |
| 11:30 - 12:00 |
Coinductive techniques, from automata to coalgebra |
Damien Pous (CNRS, LIP, ENS Lyon) |
| 12:00 - 12:30 |
The story of Arjun Guha, or: The arc of a research project |
Shriram Krishnamurthi (Brown University) |
| 12:30 - 14:00 |
LUNCH |
|
| 14:00 - 14:30 |
Proof engineering: Implementation challenges in rigorously verified software |
Adam Chlipala (MIT) |
| 14:30 - 15:00 |
Formal verification of compilers and static analyzers |
Sandrine Blazy (IRISA, University of Rennes 1) |
| 15:00 - 15:30 |
Cultivating research taste (illustrated via a journey in program synthesis research) |
Sumit Gulwani (Microsoft Research) |
| 15:30 - 16:00 |
COFFEE BREAK |
|
| 16:00 - 16:30 |
Separation logic for weak memory models |
Viktor Vafeiadis (MPI-SWS, Germany) |
| 16:30 - 17:00 |
Repeatability, reproducibility and rigor in CS research |
Jan Vitek (Northeastern University) |
| 17:00 - 17:30 |
How to give a good research talk |
Stephanie Weirich (University of Pennsylvania) |
| 17:30 - ?? |
RECEPTION |
|