Workshop Programme

Friday 28th June

13:30 to 15:30
Opening Session
13:30
Invited Talk: Suresh Jagannathan
A Relational Framework for Higher-Order Shape Analysis
14:30
Tutorial: Type-Based Analysis of Higher-Order Programs
Niki Vazou, Patrick M. Rondon, Eric Seidel, Ranjit Jhala
15:30 to 16:00
Coffee Break
16:00 to 18:00
Second Session
16:00
On Generating Constraints for Refinement Type Inference
Ruslán Ledesma-Garza, Andrey Rybalchenko
16:30
Higher-Order Program Verification as Satisfiability Modulo Theories with Algebraic Data-Types
Nikolaj Bjørner, Ken McMillan, Andrey Rybalchenko
17:00
Linear Dependent Types for Domain Specific Program Analysis
Marco Gaboardi

Saturday 29th June

9:00 to 10:00
Morning Session
9:00
Invited Talk: Neil Jones
Termination of Untyped Lambda Calculus by Flow Analysis (Joint work with Nina Bohr)
10:00 to 10:30
Coffee Break
10:30 to 12:30
Closing Session
10:30
Concrete Semantics for Pushdown Analysis: The Essence of Summarization
J. Ian Johnson, David Van Horn
11:00
Böhm Trees as Higher-Order Recursive Schemes
P. Clairambault, A. S. Murawski
11:30
An Abstraction Refinement Approach to Higher-Order Model Checking
Steven J. Ramsay, Robin P. Neatherway, C.-H. Luke Ong
12:00
Towards Tree Automata-Based Success Types
Robert Jakob, Peter Thiemann