Autumn 2015 — Wednesday, 3:30pm — CSE 203

Subscribe to the calendar: iCal or Google Calendar.

We’ll be reading and discussing exciting recent papers from the programming languages community. 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.

Date	Who	What
Sep 30	Everyone	Paper Selection
Oct 7	Bill, Sam, Calvin	The Next 700 Programming Languages
Oct 14	Nate, Talia, James	Abstracting Abstract Machines Matt Might has good blog posts on CEK machines and CESK machines
Oct 21	Brandon H., John	Incremental Computation with Names
Oct 28	Martin Monperrus	Latest Results on Automatic Software Repair Automatic software repair is the process of fixing software bugs automatically. This is a recent and active research area in the software engineering community. Before having a large impact on practice, research tries to understand the fundamental strengths and weaknesses of current repair algorithms. This talk presents the results of a recent experiment on repairing 224 real Java bugs from open source projects.
Nov 4	Alex S., Doug, Spencer, Daryl	Partial Evaluation of Computation Process: An Approach to a Compiler-Compiler
Nov 11	–	No meeting (Veterans Day)
Nov 18	Chandra, Stuart, Konne	Verified Correctness and Security of OpenSSL HMAC see also the SHA256 paper
Nov 25	–	No meeting (Thanksgiving)
Dec 2	Jared, Eric M.	Pilsner: A Compositionally Verified Compiler for a Higher-Order Imperative Language
Dec 9	Chenglong, Alex P., Pavel	Efficient Synthesis of Probabilistic Programs

Paper Suggestions

• A Unification Algorithm for COQ Featuring Universe Polymorphism and Overloading (ICFP ‘15)

• Conference Reviewing Considered Harmful

• STABILIZER: Statistically Sound Performance Evaluation (ASPLOS ‘13)

• Verification Modulo Versions: Towards Usable Verification (PLDI ‘14)

• Specification Inference Using Context-Free Language Reachability (POPL ‘15)

• KJS: A Complete Formal Semantics of JavaScript (PLDI ‘15)

• Declarative programming over eventually consistent data stores (PLDI ‘15)

• Synthesis of Machine Code from Semantics (PLDI ‘15)

• Compositional Certified Resource Bounds (PLDI ‘15)

• Conditionally Correct Superoptimization (OOPSLA ‘15)

• Synthesis of Memory Fences via Refinement Propagation (SAS ‘14)

• In Search of Types (Onward! ‘14)

• Practical Principled FRP (ICFP ‘15)

• Reasoning about the POSIX File System: Local Update and Global Pathnames (OOPSLA ‘15)

• Approximate Computation with Outlier Detection in Topaz (OOPSLA ‘15)

• Checks and Balances: Constraint Solving without Surprises in Object-Constraint Programming Languages (OOPSLA ‘15) (perhaps get Alan Borning to give a talk on it instead)

• A Co-Contextual Formulation of Type Rules and its Application to Incremental Type Checking (OOPSLA ‘15)

• Disjointness Domains for Fine-Grained Aliasing (OOPSLA ‘15)

• The Silently Shifting Semicolon (SNAPL ‘15)

• Automating Ad-hoc Data Representation Transformations (OOPSLA ‘15)

• Performance Problems You Can Fix: A Dynamic Analysis of Memoization Opportunities (OOPSLA ‘15)

• Slimming Languages by Reducing Sugar: A Case for Semantics-Altering Transformations (Onward! ‘15)

• Null References: The Billion Dollar Mistake (QCon ‘09)

• Comprehending Monads (MSC ‘92)

• The denotational semantics of programming languages (CACM ‘76)

• Recursive programming (PSL ‘60)

• From System F to Typed Assembly Language (TOPLAS ‘99)