Philipp Ruemmer

Philipp Ruemmer is a Professor of Theoretical Computer Science at University of Regensburg (2022–present) and a Senior Lecturer at Uppsala University's Department of Information Technology (2018–present). His research focuses on

• Program verification and theorem proving
• SMT/SAT solving and automata theory
• Embedded systems analysis and Java verification
• Machine learning applications in formal methods
• Concurrent and timed systems modeling

His recent work includes string constraint solvers (Norn, OSTRICH, Sloth) and model checking tools (JayHorn, Eldarica). He has authored key papers in POPL, CPP, PLDI, and VMCAI on topics like

• Transducer-based string solving
• Certified decision procedures
• Regular constraint propagation
• Flattening techniques for constraints

Notable scientific awards include the 2013 Uppsala University Oscar Prize and the 2005 SAP Award for academic excellence. He has led and participated in research grants from the Knut and Alice Wallenberg Foundation, Swedish Research Council, and Microsoft.