معرفی
Jürgen Giesl is a Professor at the Teaching and Research Area Computer Science 2 within the Department of Computer Science at RWTH Aachen University, Germany. He leads research in programming languages, formal verification, automated deduction, and term rewriting systems.
Research Interests:
- Automated Termination and Complexity Analysis of Programs
- Dependency Pairs and Term Rewriting Systems
- Verification of Probabilistic and Integer Programs
- Static Analysis and Symbolic Execution
- Model Checking and Constrained Horn Clauses
- Development of Automated Tools (AProVE, LoAT)
His recent research, reflected in the latest publications, focuses on termination and complexity analysis for probabilistic programs, polynomial loops, and integer programs, using advanced techniques such as dependency pairs, loop acceleration, and semiring semantics. He also contributes to SMT solving and transitive relation learning for infinite-state model checking.
Scientific Awards:
- Best Tool Paper Award at iFM 2017
- Silver Medal (Second Best Paper) at SEFM '16
- Best Paper Honourable Mention at IJCAR 2024
- Best Student Paper Honourable Mention at IJCAR 2024
Advising and Grants:
Giesl has supervised numerous PhD and Master’s students, including prominent researchers such as Fabian Frohn, Jens Hensel, Nils Lommen, and Marcel Hark. He leads a large research group focused on automated verification and has contributed extensively to international verification competitions. His work is supported by ongoing research grants and collaborations with leading institutions in formal methods.
Labs and Teams:
He leads the Programming Languages and Verification research group at RWTH Aachen, which develops and maintains the AProVE and LoAT tools. These tools are central to automated termination and complexity analysis and are regularly submitted to international competitions such as TERMCOMP and VBS.
