UW PLSE Reading Group (Spring 2015) (Wed 3:30pm in CSE 203)
We’ll be reading and discussing exciting recent papers from the programming languages and software engineering communities. Participants should subscribe to the 590p mailing list. Note the list also has many current and former department members interested in programming languages.
Some paper links may point into the ACM Digital Library or the Springer online collection. Using a UW IP address, or the UW libraries’ off-campus access, should provide access.
Schedule
| Date | Presenter | Topic |
|---|---|---|
| Apr 1 | Konstantin | Paper Sign-up |
| Apr 8 | James B, Brandon | Tracking the Flow of Ideas through the Programming Languages Literature (SNAPL ‘15) |
| Apr 15 | Alex P | Compiler Validation via Equivalence Modulo Inputs (PLDI’14) |
| Apr 22 | Konstantin, Daniel | Interactive Parser Synthesis by Example (PLDI’15) |
| Apr 29 | Kivanc | The Art of Testing Less without Sacrificing Quality (ICSE ‘15) |
| May 6 | Alex S, Stuart | Mtac: A Monad for Typed Tactic Programming in Coq (ICFP’13) |
| May 13 | Pavel, Eric | Programming and Reasoning with Algebraic Effects and Dependent Types (ICFP’13) |
| May 20 | James W | Efficient Synthesis of Network Updates (PLDI’15) |
| May 27 | Darioush, Bill | On Subnormal Floating Point and Abnormal Timing (S&P’15) |
| Jun 3 | Calvin, Doug | A Theory of Changes for Higher-Order Languages (PLDI ‘14) |
| Jun 10 | Nobody | Finals Week |
Unpicked Suggestions
Doug
- “The Need for Language Support for Fault-tolerant Distributed Systems” – SNAPL 2015
- “Verification of Producer-Consumer Synchronization in GPU Programs” – PLDI 2015
- “Efficient Synthesis of Probabilistic Programs” – PLDI 2015
Konstantin Weitz
- Staged Parser Combinators for Efficient Data Processing (OOPSLA’14)
- Synthesis of ranking functions using extremal counterexamples (PLDI’15)
Dan Grossman
- Concurrency Debugging with Differential Schedule Projections (PLDI’15)
- A Simpler, Safer Programming and Execution Model for Intermittent Systems (PLDI’15)
Pavel Panchekha
- Programming up to Congruence (POPL’15)
- Predicting Program Properties from “Big Code” (POPL’15)
These next two papers at PLDI’15 papers. I’m hoping they post them quickly, so we can read them. We might want to choose a backup paper.
- Defining the undefinedness of C (PLDI’15)
- Finding Counterexamples from Parsing Conflicts (PLDI’15)
A classic:
- Go To Statement Considered Harmful (CACM’68)
Eric M
- A Formal C Memory Model Supporting Integer-Pointer Casts (PLDI’15)
- Defining the Undefinedness of C (PLDI’15)
Brandon H
- The Push-Pull Model of Transactions (PLDI’15)
- Declarative Programming over Eventually Consistent Data Stores (PLDI’15)
Alex Polozov
- Efficient Synthesis of Probabilistic Programs (PLDI’15)