معرفی
Florian Frohn is a tenured lecturer ("Lehrkraft für besondere Aufgaben") in the Programming Languages and Verification research group at the Department of Computer Science, RWTH Aachen University. He holds a Dr. rer. nat. (2018), MSc (2013), and BSc (2011) in Computer Science, all from German institutions, with his bachelor's studies completed part-time.
His research interests center on formal methods for software verification, including automated termination and complexity analysis of imperative programs, satisfiability of Constrained Horn Clauses (CHCs), SMT solving with integer exponentiation, loop acceleration, term rewriting systems, and abstract interpretation. He is a key contributor to several influential tools: LoAT (Loop Acceleration Tool), AProVE (Automated Program Verification Environment), and SwInE; he also worked on Astrée and the CAGE toolchain developed under the DARPA STAC program.
His recent publications (2023–2024) demonstrate continued leadership in top venues such as FM, IJCAR, FoSSaCS, and SAS, with work advancing loop acceleration, non-termination proofs, and SMT solving. These contributions reflect a strong trend in developing practical, automated techniques for program verification and analysis.
- IJCAR Best paper honourable mention (2024)
- EASST Award for best ETAPS paper (2020)
- iFM Best Tool Paper Award (2017)
- ISR Best Poster Award (2017)
- SEFM Recognition Award (2016)
- CADE Woody Bledsoe Travel Award (2016)
Florian Frohn actively contributes to the research community through program committee roles for major workshops and conferences including TACAS, HCVS, WST, SMT, and LPAR. He has advised no listed students but has been involved in mentoring through research collaborations. His teaching portfolio includes courses on verification techniques, satisfiability checking, and advanced programming concepts. He leads the Termination and Complexity Competition (termCOMP) and participates in organizing key events in the formal methods community.
