Abstract:

We give an overview on our results obtained within UnRAVeL. Before the start of the research training group, we had already developed several techniques for automated termination and complexity analysis for different kinds of "classical" programs. We show how these approaches were extended to probabilistic programs due to our research within UnRAVeL.

--------------------

Part of the programme of the research training group UnRAVeL is a series of lectures on the topics of UnRAVeL’s research thrusts algorithms and complexity, verification, logic and languages, and their application scenarios. Each lecture is given by one of the researchers involved in UnRAVeL.

This years topic is "Highlights of UnRAVeL!". As UnRAVeL nears its conclusion, we take this opportunity to reflect on seven years of excellent research. Through nine talks, we invite you to experience the scientific highlights of our RTG, along with its numerous successes, developments, and collaborations.

All interested doctoral researchers and master students are invited to attend the UnRAVeL lecture series 2025 and engage in discussions with researchers and doctoral students.

The overall remaining schedule is as following:

24.04.2025 - Jürgen Giesl - Termination and Complexity Analysis: From Classical to Probabilistic Programs

08.05.2025 - Nils Nießen - Uncertainty in Railways

15.05.2025 - Joost-Pieter Katoen - Verification Conquers Fault Tree Analysis: From Theory to Start-Up

22.05.2025 - Britta Peis - On Train Routing and Length-bounded Disjoint Paths

26.06.2025 - Michael Schaub - Oversmoothing in Graph Neural Networks

03.07.2025 - Sebastian Trimpe - Uncertainty in Learning and Control

10.07.2025 - Christopher Morris - Exploring the Power of Graph Neural Networks in Solving Optimization Problems

17.07.2025 - Christina Büsing - Dealing with Uncertainty Inspired by Health Care – a Robust Optimization Approach

Kind regards,

Jan-Christoph for the organisation committee