29 October 2018, 2 PM
TUM MI 00.12.019
Automated invariant generation is a fundamental challenge in program analysis and verification, going back many decades, and remains a topic of active research. In this talk I’ll present a select overview and survey of work on this problem, and discuss unexpected connections to other fields including algebraic geometry, group theory, and quantum computing. (No previous knowledge of these fields will be assumed.)
This is joint work with Ehud Hrushovski, Amaury Pouly, and James Worrell.