Stefan Milius

Stefan Milius is a Senior Lecturer (Akademischer Direktor) at the Chair of Theoretical Computer Science (Computer Science 8) within the Faculty of Engineering at Friedrich-Alexander University Erlangen-Nuremberg (FAU). He is actively involved in research, teaching, and academic leadership, with a strong emphasis on theoretical foundations of computer science.

His research interests are centered on coalgebras, category theory, universal algebra, formal verification, semantics of iteration and recursion, and logic in computer science. He investigates algebraic and categorical methods for modeling and reasoning about computational systems, particularly through the lens of fixed points, automata, and logical semantics.

His recent publications (2022–2025) span top-tier venues such as LICS, CALCO, ICALP, MFPS, POPL, and CONCUR, showcasing a consistent focus on algebraic language theory with effects, nominal automata, graded semantics, bialgebraic reasoning, and coalgebraic algorithms. The work often involves deep categorical constructions and has applications in program equivalence, formal verification, and automata minimization.

Stefan Milius has received several prestigious awards, including:

• Ackermann Award (2006) for his PhD thesis
• Best Theory Paper at FM 2019
• EATCS Best Paper Award at MFCS 2017
• CALCO 2015 Best Paper Award
• Braunschweig Prize for Outstanding Academic Achievements (2000)

He plays a significant role in the academic community as Editor-in-Chief of Logical Methods in Computer Science (since 2020), member of the advisory board of TheoretiCS, and editorial board member of Applied Categorical Structures. He has served on numerous program and steering committees, including FoSSaCS, LICS, MFPS, CALCO, and CMCS. He has also supervised student projects and thesis topics in theoretical computer science, though specific student names are not listed.

He has been involved in externally funded research, including the BMBF project VerSyKo at TU Braunschweig (2011–2012), focusing on formal verification of synchronous software components. His current work continues to advance foundational methods in theoretical computer science with broad applicability.