World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
42
Citations
5925
World Ranking
8515
National Ranking
418

Overview

Jürgen Giesl is affiliated with RWTH Aachen University in Germany, where their work primarily focuses on the field of Computer Science. Their research spans multiple subfields including Artificial Intelligence, Computational Theory and Mathematics, Software, Information Systems, and Hardware and Architecture.

The main topics covered in their research include Formal Methods in Verification, Logic, Programming, and Type Systems, Software Testing and Debugging Techniques, Natural Language Processing Techniques, Semantic Web and Ontologies, Software Engineering Research, and Software Reliability and Analysis Research.

Jürgen Giesl has contributed to a range of recent publications. Notable papers include:

  • Polynomial Loops: Beyond Termination (2020, EPiC series in computing)
  • Termination of triangular polynomial loops (2023, Formal Methods in System Design)
  • A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting (2023, arXiv, Cornell University)
  • Integrating Loop Acceleration into Bounded Model Checking (2024, arXiv, Cornell University)
  • Proving Non-Termination by Acceleration Driven Clause Learning (2023, arXiv, Cornell University)

Their frequent collaborators include Florian Frohn, Jan-Christoph Kassing, Nils Lommen, Marcel Hark, and Jera Hensel. These coauthors contribute to a significant number of joint publications, indicating ongoing research partnerships.

Jürgen Giesl's work is often published in well-regarded venues, with the majority of publications appearing in arXiv (Cornell University). Other publication venues include EPiC series in computing, Formal Methods in System Design, RWTH Publications (RWTH Aachen), and Zenodo (CERN European Organization for Nuclear Research).

Best Publications

  • Termination of term rewriting using dependency pairs

    Thomas Arts;Jürgen Giesl

  • AProVE 1.2: automatic termination proofs in the dependency pair framework

    Jürgen Giesl;Peter Schneider-Kamp;René Thiemann

  • Mechanizing and Improving Dependency Pairs

    Jürgen Giesl;René Thiemann;Peter Schneider-Kamp;Stephan Falke

  • The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs

    Jürgen Giesl;René Thiemann;Peter Schneider-Kamp

  • Automated Termination Proofs with AProVE

    Jürgen Giesl;René Thiemann;Peter Schneider-Kamp;Stephan Falke

  • SAT solving for termination analysis with polynomial interpretations

    Carsten Fuhs;Jürgen Giesl;Aart Middeldorp;Peter Schneider-Kamp

  • Analyzing Program Termination and Complexity Automatically with AProVE

    Jürgen Giesl;Cornelius Aschermann;Marc Brockschmidt;Fabian Emmes

  • Proving and disproving termination of higher-order functions

    Jürgen Giesl;René Thiemann;Peter Schneider-Kamp

  • Proving Termination of Programs Automatically with AProVE

    Jürgen Giesl;Marc Brockschmidt;Fabian Emmes;Florian Frohn

  • Modular Termination Proofs for Rewriting Using Dependency Pairs

    Jürgen Giesl;Thomas Arts;Enno Ohlebusch

  • Automated termination proofs for haskell by term rewriting

    Jürgen Giesl;Matthias Raffelsieper;Peter Schneider-Kamp;Stephan Swiderski

  • Automated termination analysis for Haskell: from term rewriting to programming languages

    Jürgen Giesl;Stephan Swiderski;Peter Schneider-Kamp;René Thiemann

  • Analyzing Runtime and Size Complexity of Integer Programs

    Marc Brockschmidt;Fabian Emmes;Stephan Falke;Carsten Fuhs

  • Automated Termination Analysis of Java Bytecode by Term Rewriting

    Carsten Otto;Marc Brockschmidt;Christian von Essen;Jürgen Giesl

  • Automatically Proving Termination Where Simplification Orderings Fail

    Thomas Arts;Jürgen Giesl

  • Alternating runtime and size complexity analysis of integer programs

    Marc Brockschmidt;Fabian Emmes;Stephan Falke;Carsten Fuhs

  • Transformation techniques for context-sensitive rewrite systems

    Jürgen Giesl;Aart Middeldorp

  • Generating Polynomial Orderings for Termination Proofs

    Jürgen Giesl

  • Termination of Nested and Mutually Recursive Algorithms

    Jürgen Giesl

  • Verification of Erlang Processes by Dependency Pairs

    Jürgen Giesl;Thomas Arts

  • Automatic Termination Proofs in the Dependency Pair Framework.

    Jürgen Giesl;Peter Schneider-Kamp;René Thiemann

Frequent Co-Authors

Marc Brockschmidt
Marc Brockschmidt Google (United States)
Michael Codish
Michael Codish Ben-Gurion University of the Negev
Reiner Hähnle
Reiner Hähnle Technical University of Darmstadt
Alexander Serebrenik
Alexander Serebrenik Eindhoven University of Technology
Tobias Nipkow
Tobias Nipkow Technical University of Munich
Thomas Ball
Thomas Ball Microsoft (United States)
Deepak Kapur
Deepak Kapur University of New Mexico
Joost-Pieter Katoen
Joost-Pieter Katoen RWTH Aachen University
Franz Baader
Franz Baader TU Dresden

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

As computer science continues to evolve, numerous online degrees offer flexible options for advancing your education and career. Earning credentials from one of the highly accredited online universities can provide a solid foundation recognized by employers nationwide.

For those interested in creative and technical fields, pursuing a game design masters online can open doors to roles in game development, animation, and interactive media. Alternatively, students keen on digital security can explore a cyber security bachelor degree online, addressing the growing demand for information security professionals.

Expanding further, some interdisciplinary pathways such as construction degrees also incorporate elements of technology, project management, and data analysis—skillsets highly valued in today’s technology-driven world.

These related online programs are not only versatile but also affordable, making them accessible to a broad range of students seeking specialized, in-demand skills in the digital age.

Best Scientists Citing Jürgen Giesl

Trending Scientists

Recently Published Articles