Program


Monday

 09:00 - 10:00
 Keynote Talk
 Orna Grumberg Modular demand-driven analysis of semantic difference for program versions
 10:00 - 10:30 Erich Grädel Semiring provenance for logic and games
 10:30 - 11:00 coffee break  
 11:00 - 11:30 Michael Tautschnig Challenges in analysing virtualisation stacks
 11:30 - 12:00 Temur Kutsia Pattern-based calculi with finitary matching
 12:00 - 12:30 Michael Morak The impact of treewidth on ASP grounding and solving


Tuesday

 09:00 - 09:30 Oliver Lehmann The March for Science – to which destination?
 09:30 - 10:00 Igor Konnov Towards symbolic model checking of fault-tolerant designs in TLA+
 10:00 - 10:30 Anna Lukina Attacking the V
 10:30 - 11:00 coffee break  
 11:00 - 11:30 Josef Widder Synthesis of distributed algorithms with parameterized threshold guards
 11:30 - 12:00 Wolfgang Dvořák Lower bounds for symbolic computation on graphs
 12:00 - 12:30 Gernot Salzer The Complexity of finding the next Whisky Bar


Wednesday

 09:30 - 10:00 Uwe Egly QRAT+: A Powerful Redundancy Elimination Method
 10:00 - 10:30 Friedrich Slivovsky Recent trends in QBF solving
 10:30 - 11:00 coffee break  
 11:00 - 11:30 Ana Sokolova The power of convex algebras
 11:30 - 12:00 Sebastian Arming Finding parameter-agnostic policies for parametric MDPs
 12:00 - 12:30 Georg Weissenbacher Interpolants from DRAT proofs
 12:30              Closing