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
Mar 30	Martin and Rashmi	Inferring Mutant Utility from Program Context
Apr 6	Steve and Jared	Tensor Comprehensions: Framework-Agnostic High-Performance Machine Learning Abstractions
Apr 13	Doug by himself :(	Inferring and Asserting Distributed System Invariants
Apr 20	Nate and Chenglong	Program Synthesis using Abstraction Refinement
Apr 27	Remy	Precise Interprocedural Dataflow Analysis via Graph Reachability (classic) (POPL version)
May 4	Sam and Bill	Deepcoder: Learning To Write Programs
May 11	Steve	Efficient Sampling of SAT Solutions for Testing
May 18	Chandra	Synthesis with Abstract Examples
May 25	Talia	When Good Components Go Bad
Jun 1	Pavel	The Road to Live Programming: Insights From the Practice

Scheduling

Feel free to swap papers and dates or add yourself as a co-presenter to a topic.

Some Options for Autumn

• Synthesizing Robust Adversarial Examples
• Synthesizing an Instruction Selection Rule Library from Semantic Specifications
• Learning to Infer Graphics Programs from Hand-Drawn Images
• Premise Selection for Theorem Proving by Deep Graph Embedding
• Deep Network Guided Proof Search

Previous suggestions:

• Are Mutation Scores Correlated with Real Fault Detection? A Large Scale Empirical study on the Relationship Between Mutants and Real Faults
• Efficient Sampling of SAT Solutions for Testing
• Inferring and Asserting Distributed System Invariants
• RFC-Directed Differential Testing of Certificate Validation in SSL/TLS Implementations
• Statistical Errors in Software Engineering Experiments: A Preliminary Literature Review
• Symbolic Verification of Regular Properties
• The Road to Live Programming: Insights From the Practice
• Practical Partial Evaluation for High-Performance Dynamic Language Runtimes
• Simple Testing Can Prevent Most Critical Failures: An Analysis of Production Failures in Distributed Data-Intensive Systems
• Automating Failure Testing Research at Internet Scale
• Lineage-driven Fault Injection
• Weird machines, exploitability, and provable unexploitability
• 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