In 2019, Andreas Pavlogiannis joined the Programming Languages research group at the Department of Computer Science as a Tenure Track Assistant Professor. Since he arrived at the department, Andreas's main research has been focusing on algorithmic aspects of software verification.
Andreas develops automated techniques - based on rigorous foundations such as automata theory, graph theory and combinatorial optimization - which reason about program correctness and efficiency, and assist the compiler towards performance optimizations. As these tasks are predominantly computationally heavy, Andreas's research has a strong focus on the algorithmic component, that aims to develop the provably most efficient algorithm for a given program analysis task. This line of research is both fun and highly practical: the intricacies of program verification yield many theoretically intriguing questions that, once solved, come alive in program-verification tools.
Andreas's research also spans to mathematical models of evolution that arise in a biological and/or social context. In this setting, he studies questions such as "how long does it take for a novel mutation to fixate in a population?", and "what is the probability that a new opinion will become dominant in a social network?". To this end, he contributes to the fields of evolutionary graph theory and evolutionary game theory.
Andreas holds a joint BSc/MSc degree from the University of Patras, as well as a MSc degree from the University of California Davis. He received his PhD at the Institute of Science and Technology Austria in 2018. Prior to joining Aarhus University, he spent two years as a joint INRIA/EPFL Fellow as well as a Schrodinger Fellow at the Ecole Polytechnique Federale de Lausanne (EPFL).
