Prof. Dr. Florian Zuleger
Group Leader
Scientific Profile
My research is in theoretical computer science and concerns the mathematical foundations of programs and programming languages. As software is increasingly developed with the help of artificial intelligence and code is generated automatically, a fundamental question arises: How can we not only generate programs, but also reason automatically about whether they have the desired properties? To address this question, I develop mathematical foundations, algorithms, and tools for automated reasoning about programs and software systems.
I combine methods from logic and automata theory, formal semantics and type systems, abstract interpretation, graph theory, and complexity theory. My work ranges from foundational results on expressiveness, decidability, and complexity to the implementation and evaluation of new analysis techniques. I also investigate how machine learning can support automated proof search and how AI models can be described and analysed using logical methods.
Further information is available on the pages describing our research and research projects.
Academic Career
I studied mathematics and computer science at the Technical University of Munich and subsequently obtained my doctorate in computer science from TU Wien. At TU Wien, I first held a position as Assistant Professor and later as Associate Professor and Professor at the Institute of Logic and Computation. Further stages of my academic career included a research internship at Microsoft Research in Redmond and a research visit to the Institut de Recherche en Informatique Fondamentale (IRIF) in Paris.
Since June 2026, I have headed the Chair of Fundamentals of Programming at the Technical University of Munich.
Teaching and Supervision
Information about my current courses is available under Teaching. Topics for Bachelor’s and Master’s theses, as well as further information about supervision, can be found under Theses.
Research Profiles
Selected Publications
- Armin Walch, Georg Moser, Berry Schoenmakers, and Florian Zuleger. Automated Amortised Analysis of Skew Heaps and Leftist Heaps. In CAV 2026, pp. 100–122.
- Marius Bozga, Radu Iosif, and Florian Zuleger. Regular Grammars for Sets of Graphs of Tree-Width 2. In LICS 2025, pp. 704–717.
- Florian Sextl, Adam Rogalewicz, Tomáš Vojnar, and Florian Zuleger. Compositional Shape Analysis with Shared Abduction and Biabductive Loop Acceleration. In ESOP 2025, pp. 230–257.
- Alexander Loitzl and Florian Zuleger. Modeling Register Pairs in CompCert. In iFM 2024, pp. 128–147. Runner-up for the Best Paper Award.
- Jens Pagel and Florian Zuleger. Strong-separation Logic. ACM Transactions on Programming Languages and Systems, 44(3), 2022, pp. 16:1–16:40.
- Lukáš Holík, Petr Peringer, Adam Rogalewicz, Veronika Šoková, Tomáš Vojnar, and Florian Zuleger. Low-Level Bi-Abduction. In ECOOP 2022, pp. 19:1–19:30.
- Lorenz Leutgeb, Georg Moser, and Florian Zuleger. Automated Expected Amortised Cost Analysis of Probabilistic Data Structures. In CAV 2022, pp. 70–91.
- Florian Zuleger. The Polynomial Complexity of Vector Addition Systems with States. In FoSSaCS 2020, pp. 622–641.
- Sumit Gulwani, Ivan Radiček, and Florian Zuleger. Automated Clustering and Program Repair for Introductory Programming Assignments. In PLDI 2018, pp. 465–480.
- Moritz Sinn, Florian Zuleger, and Helmut Veith. A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis. In CAV 2014, pp. 745–761.
A complete list of my publications is available on DBLP.
Contact
Technical University of Munich
TUM School of Computation, Information and Technology
Chair of Fundamentals of Programming
Boltzmannstr. 3
85748 Garching bei München
Germany
Room: 00.09.055, wing 9, ground floor
Email: f.zuleger@tum.de
Office hours: by appointment via email