Oregon Programming Languages Summer School


June 20-July 2, 2016

Types, Logic, Semantics, and Verification

Technical Lectures

The sessions are non-overlapping, so participants will have the opportunity to attend all lectures. Each lecture is 80 minutes, including time for questions.

Morning Afternoon
Date Session 1 Session 2 Session 1 Session 2
MON 6/20 Harper Licata Morehouse Hands-On Session
TUE 6/21 Harper Morehouse Licata Hands-On Session
WED 6/22 Licata Harper Morehouse Hands-On Session
THR 6/23 Morehouse Harper Licata Hands-On Session
FRI 6/24 Johann Foster Hoffmann Hands-On Session
SAT 6/25 Foster Hoffmann Johann Foster
SUN 6/26 Excursion
MON 6/27 Foster Johann Hoffmann Hands-On Session
TUE 6/28 Johann Hoffmann Hands-On Session Ahmed
WED 6/29 Nanevski Zeilberger Ahmed Hands-On Session
THR 6/30 Zeilberger Ahmed Nanevski Hands-On Session
FRI 7/1 Ahmed Nanevski Zeilberger Hands-On Session
SAT 7/2 Zeilberger Nanevski Hands-On Session

Lectures are held in 110 Knight Law Center, except July 1 lectures held in 182 Lillis and July 2 lectures held in 145 Straub. Morning sessions begin at 9:00 AM and run until noon. Afternoon sessions begin at 2:00 PM and run until 5:00 PM.

Participant Talks

Participants are encouraged to share their current research. Student talks should be organized as a 10 minute presentation, followed by 10 minutes of question and answer. The point of Participant Talks is to create interest around your research. Talks about unfinished research or future directions are encouraged.

Date Time Presentor Title
TUE 6/21 8:00PM Marianna Rapoport Tracking Side Effects Using the Type System in Scala
8:20PM Peter Campora Extending Counter Factual Typing for Debugging Type Errors
8:40PM Ambrose Bonnaire-Sergeant Inferring recursive type annotations from tests for Typed Clojure
THR 6/23 8:00PM Ankit Kumar Shukla Graph-Theoretic Properties of Biological Intra-Cellular Traffic Systems
8:20PM Jon Sterling RedPRL: Designing the People's Refinement Logic
8:40PM Marco Vessena Language-Based Security via libraries
9:00PM Maria A Schett From Trees to Graphs: Kruskal's Tree Theorem & Termination
9:20PM Xiaolong Guo Proof-Carrying Hardware for Intellectual Property Protection
9:40PM Yuyan Bao Unifying Fine-Grained Region Logic with Separation Logic
TUE 6/28 8:00PM Michael Ballantyne Comprehensible Hygienic Macro Expansion via Scope Graphs
8:20PM Sven Keidel Abstract Interpretation of a Term Rewriting Language
8:40PM Sebastian Ullrich Verifying Rust Programs via Functional Purification
9:00PM Andrew Kent Typed Racket + Refinement Types
9:20PM Florian Biermann Functional Parallel Programming in a Spreadsheet Model of Computation
9:40PM Benno Stein Goal-Directed Abstract Interpretation for JavaScript
THR 6/30 8:00PM Stefan Knudsen Indexed Reactive Programming
8:20PM Andres Erbsen Synthesizing High-Performance Cryptographic Implementations in plain Coq
8:30PM Kenny Foner Choose Your Own Derivative
9:00PM Steven Libby Introduction to Functional Logic Programming
9:20PM Kiko Fernandez Reyes Let's ParT!
9:40PM Julian Sutherland Modular Termination Verification for Non-Blocking Concurrent Programs
10:00PM Amin Timany Context refinement proof using logical relations in Iris

Talks are held in 220 Deschutes, the Computer Science Colloquim room, beginning at 8PM. The building is locked at night, so please be prompt or you will not be able to enter the building. To schedule a talk, email Jim.

© University of Oregon Department of Computer and Information Science, 1202 University of Oregon, Eugene OR 97403-1202