Tomer Kotek is a postdoctoral researcher in the Faculty of Informatics at the Vienna University of Technology. He earned his PhD in Computer Science at the Technion, in Haifa. His dissertation, Definability of Combinatorial Functions, was advised by Johann A. Makowsky. Since 2013, he has worked with Prof. Helmut Veith in his Formal Methods in Systems Engineering group. His main academic interests lie in the application of logical methods to program verification and counting complexity. In recent years, his work has been focused on decidable extensions of the two-variable fragment of first order logic and their use for program verification, as well as verification of concurrent systems parameterized by the number of components.