Invited Talks

Eva Darulova

Title: (Working) Principles and (Open) Challenges in Automated Floating-Point Verification

Abstract:

Reasoning about floating-point arithmetic is hard: special values and rounding errors make manual reasoning about numerical correctness essentially impossible for everyone but experts. All hope is not lost though, automated reasoning to verify floating-point computations has become feasible and reasonably mature in many cases. In this talk, Eva Darulova will provide an overview of what works today, where open challenges remain for handling real-world programs, and how recent efforts aim to address some of these.

Sebastian Junges

Title: Satisfiability-Modulo-Probabilistic Model Checking: Synthesising Robust & Concise Strategies under Uncertainty

Laura Kovács

Title: Learning and Proving Array Invariants