April 22, 2017
| 8:45 – 9:00 | Welcome |
| 9:00 – 10:00 | Jan Reineke |
| Challenges for Timing Analysis of Multi-Core Architectures |
| Coffee |
| 10:30 – 11:00 | Florian Zuleger |
| Inductive Termination Proofs by Transition Predicate Abstraction and their relationship to the Size-Change Abstraction | |
| 11:00 – 11:30 | Michael Schaper |
| GUBS Upper Bound Solver | |
| 11:30 – 12:00 | Romain Péchoux |
| Higher order interpretations for higher order complexity |
| Lunch |
| 14:00 – 15:00 | Kerstin Eder |
| Whole Systems Energy Transparency: More Power to Software Developers! |
| 15:00 – 15:30 | Marko van Eekelen |
| Towards practical, precise and parametric energy analysis of IT controlled systems |
| Coffee |
| 16:00 – 16:30 | Patrick Baillot |
| Towards an implicit characterisation of the polynomial hierarchy in an unbounded arithmetic | |
| 16:30 – 17:00 | Cynthia Kop |
| Cons-free programming with immutable functions |
April 23, 2017
Invited Talk 3 (chair: Guillaume Bonfante)| 9:00 – 10:00 | Elvira Albert |
| Resource Analysis of Distributed and Concurrent Programs |
| Coffee |
| 10:30 – 11:00 | Jean-Yves Moyen |
| Computability in the Lattice of Equivalence Relations | |
| 11:00 – 11:30 | Martin Avanzini |
| Automating Sized-Type Inference and Complexity Analysis | |
| 11:30 – 12:00 | Charles Grellois |
| Two Type-Theoretic Approaches to Probabilistic Termination | |
| 12:00 – 12:30 | Pierre Vial |
| The Collapse of Sequential to Multiset Intersection Type Systems is Surjective |
| Lunch |
| 14:00 – 15:00 | Lars Kristiansen |
| On Resource Analysis of Imperative Programs |
| 15:00 – 15:30 | Thomas Rubiano |
| Loop Quasi-Invariant Chunk Motion by peeling with statement composition |
| Coffee |
| 16:00 – 16:30 | Bruno Guillaume (talk given by Guillaume Bonfante) |
| Bounded Graph Rewriting for Natural Language Processing |