معرفی
Philipp Rümmer is a Professor of Theoretical Computer Science at the University of Regensburg and a Senior Lecturer/Associate Professor at the Department of Information Technology, Uppsala University. His career spans over two decades of academic and industrial collaboration in formal verification, SMT solvers, and program analysis.
- Professor (2022–present), Faculty of Informatics and Data Science, University of Regensburg
- Senior Lecturer/Associate Professor (2018–present), Department of Information Technology, Uppsala University
His research focuses on formal verification of software and embedded systems, SMT solvers (e.g., Princess, Norn), model checking (Eldarica), and integrating machine learning with verification techniques. He has pioneered tools like JayHorn for Java verification and Sloth for string constraint solving.
Recent publications emphasize probabilistic verification of parameterized systems, timing analysis in embedded updates, heap invariants via Horn clauses, and graph neural networks in solving word equations. These works reflect his commitment to advancing formal methods through interdisciplinary approaches.
Awards include:
- Oscarspris (2013), Uppsala University
- SAP Award for top Computer Science graduate (2005)
- Bosch Telecom Award for natural science excellence (1998)
He has secured significant grants from the Swedish Research Council, Knut and Alice Wallenberg Foundation, and Microsoft Research, supporting projects like UPDATE (2020–2024) and WebSec (2018–2023). His leadership in tools such as Princess and Eldarica underscores his influence in automated reasoning and verification.
