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\u27ll 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 topics will be assumed.) This is joint work with Ehud Hrushovski, Amaury Pouly, and James Worrell
We provide an introduction to enumerating and constructing invariants of group representations via c...
10.1007/978-3-642-39698-4_19Lecture Notes in Computer Science (including subseries Lecture Notes in ...
There are a few different methods for formally proving that a program agrees with its specifica-tion...
Abstract—Program invariants are statements or assertions that are widely used in program analysis an...
This book is about the computational aspects of invariant theory. Of central interest is the questio...
J. Kung and G.-C. Rota, in their 1984 paper, write: "Like the Arabian phoenix rising out of its ashe...
The history of invariant theory spans nearly a century and a half, with roots in certain problems fr...
© 2017 ACM. Program invariant is a fundamental notion widely used in program verification and analys...
This chapter provides the reader with the necessary background for dealing with semidefinite program...
In order to evoke a discussion about possible future research themes for the Eindhoven Department of...
This volume of expository papers is the outgrowth of a conference in combinatorics and invariant the...
Abstract. The discovery of invariants and ranking functions plays a central role in program verifica...
The subject matter for this series of lectures is algebraic geometry invariant theory and computatio...
This article describes and evaluates DIG, a dynamic invariant generator that infers invariants from ...
The discovery of invariants and ranking functions plays a central role in program verification. In o...
We provide an introduction to enumerating and constructing invariants of group representations via c...
10.1007/978-3-642-39698-4_19Lecture Notes in Computer Science (including subseries Lecture Notes in ...
There are a few different methods for formally proving that a program agrees with its specifica-tion...
Abstract—Program invariants are statements or assertions that are widely used in program analysis an...
This book is about the computational aspects of invariant theory. Of central interest is the questio...
J. Kung and G.-C. Rota, in their 1984 paper, write: "Like the Arabian phoenix rising out of its ashe...
The history of invariant theory spans nearly a century and a half, with roots in certain problems fr...
© 2017 ACM. Program invariant is a fundamental notion widely used in program verification and analys...
This chapter provides the reader with the necessary background for dealing with semidefinite program...
In order to evoke a discussion about possible future research themes for the Eindhoven Department of...
This volume of expository papers is the outgrowth of a conference in combinatorics and invariant the...
Abstract. The discovery of invariants and ranking functions plays a central role in program verifica...
The subject matter for this series of lectures is algebraic geometry invariant theory and computatio...
This article describes and evaluates DIG, a dynamic invariant generator that infers invariants from ...
The discovery of invariants and ranking functions plays a central role in program verification. In o...
We provide an introduction to enumerating and constructing invariants of group representations via c...
10.1007/978-3-642-39698-4_19Lecture Notes in Computer Science (including subseries Lecture Notes in ...
There are a few different methods for formally proving that a program agrees with its specifica-tion...