PLSE Reading Group
Winter 2018 — Friday, 3:30pm — CSE 203
Subscribe to the calendar: iCal or Google Calendar.We’ll be reading and discussing exciting recent papers from the broader Software Engineering and Programming Language community, with a slight bias toward topics folks in UW PLSE are exploring.
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.
| Date | Who | What |
|---|---|---|
|
Jan 19
|
Sarah Chasins |
WebRelate: Integrating Web Data with Spreadsheets using Examples |
|
Jan 26
|
Chandrakana Nandi and James Rasmussen Wilcox |
The Linearity Monad |
|
Feb 2
|
Doug “Distributed Systems” Woos and Martin “Testing” Kellogg |
Why Is Random Testing Effective for Partition Tolerance Bugs? |
|
Feb 9
|
Talia Ringer and Remy Wang |
A Principled approach to Ornamentation in ML |
|
Feb 16
|
Zach Tatlock and Bill Zorn |
A Comprehensive Study of Real-World Numerical Bug Characteristics |
|
Feb 23
|
John Toman and Calvin Loncaric |
DéjàVu: a map of code duplicates on GitHub |
|
Mar 2
|
Max |
Experimental Biological Protocols with Formal Semantics |
|
Mar 9
|
Nate and Stuart |
Lem: Reusable Engineering of Real-world Semantics |
Scheduling
Feel free to swap papers and dates or add yourself as a co-presenter to a topic.
Some Options for Spring
- Complexity verification using guided theorem enumeration
- Keep It SIMPLEX: Satisfying Multiple Goals with Guarantees in Control-Based Self-Adaptive Systems
- Towards Automatic Resource Bound Analysis for OCaml
- Repairing Decision-Making Programs Under Uncertainty
- Paxos Made EPR: Decidable Reasoning about Distributed Protocols
- Towards Complete Specification and Verification with SMT
- Taming the Length Field in Binary Data: Calc-Regular Languages
- Dead Store Elimination (Still) Considered Harmful
- Growing a Protocol
- Key Reinstallation Attacks: Forcing Nonce Reuse in WPA2
- Turing-Completeness Totally Free
- Optimizing Dynamically-Typed Object-Oriented Languages With Polymorphic Inline Caches
- Guarded recursive datatype constructors
- Towards Efficient, Typed LR Parsers
- Sound, Complete, and Tractable Linearizability Monitoring for Concurrent Collections
- A formally verified compiler for Lustre (neutrons related)
- End-User Programming of Mashups with Vegemite
- Closing the Gap – The Formally Verified Optimizing Compiler CompCert