| 9:00 – 10:00 |
|
|
Coffee Break |
| 10:20 – 11:20 |
- Bogdan Mihaila : Synthesizing Predicates from Abstract Domain Losses
- Suvam Mukherjee : Efficient Shape Analysis of Multithreaded Programs
- Mitra Tabaei Befrouei : Abstraction and Mining of Traces to Explain Concurrency Bugs
- Christian Müller : An Analysis of Universal Information Flow based on Self-Compositions
- Björn Engelmann : Formally Verifying Dynamically-typed Programs like Statically-typed Ones – A different perspective
|
|
Coffee Break |
| 11:40 – 12:40 |
- Philipp Hoffmann : Negotiations as a concurrency primitive: Summaries and Games
- Giuseppe Perelli : Strategy Logic: a powerful formalism for game-theoretical issues
- Vadim Malvone : Graded Strategy Logic
- Oliver Fernandez Gil : Threshold Concepts in a Lightweight Description Logic
- Andreas Ecke : Relaxing Description Logics Queries using Similarity Measures
|
|
Lunch Break
|
| 14:00 – 15:00 |
|
|
Coffee Break |
| 15:20 – 16:30 |
- Fabian Immler : Continuous Systems Reachability using Adaptive Runge-Kutta Methods – Formally Verified
- Manuel Eberl, Johannes Hölzl and Tobias Nipkow : A Verified Compiler for Probability Density Functions
- Benjamin Lucien Kaminski : Analyzing Expected Outcomes and (Positive) Almost-Sure Termination of Probabilistic Programs is Hard
- Friedrich Gretz : Conditioning in Probabilistic Programming
- Nils Jansen : A Greedy Approach for the Efficient Repair of Stochastic Models
- Oliver Göbel : On Stochastic Input Models in Online Optimization
|
