Jürgen Giesl

RWTH Aachen University — Germany

Computer Science · Physical Sciences

36h-index4.2kcitations213works1.22yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Logic, programming, and type systems(137), Formal Methods in Verification(111), Logic, Reasoning, and Knowledge(45), Software Testing and Debugging Techniques(40), Natural Language Processing Techniques(30)

Publications213 total

The annotated dependency pair framework for almost-sure termination of probabilistic term rewriting
Science of Computer Programming·2025Open Access
Small Term Reachability and Related Problems for Terminating Term Rewriting Systems
Logical Methods in Computer Science·2025Open Access
Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term Rewriting
arXiv (Cornell University)·2025· 1 citedOpen Access
Infinite State Model Checking by Learning Transitive Relations
arXiv (Cornell University)·2025· 1 citedOpen Access
AProVE (KoAT + LoAT)
Lecture notes in computer science·2025· 1 citedOpen Access
Infinite State Model Checking by Learning Transitive Relations
Lecture notes in computer science·2025Open Access
The Annotated Dependency Pair Framework for Almost-Sure Termination of Probabilistic Term Rewriting
arXiv (Cornell University)·2024Open Access
Small Term Reachability and Related Problems for Terminating Term Rewriting Systems
arXiv (Cornell University)·2024Open Access
Targeting Completeness: Automated Complexity Analysis of Integer Programs
arXiv (Cornell University)·2024· 1 citedOpen Access
Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
Lecture notes in computer science·2024
From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity
arXiv (Cornell University)·2024· 1 citedOpen Access
Integrating Loop Acceleration Into Bounded Model Checking
Lecture notes in computer science·2024· 3 citedOpen Access
Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
arXiv (Cornell University)·2024· 1 citedOpen Access
A Dependency Pair Framework for Relative Termination of Term Rewriting
arXiv (Cornell University)·2024· 1 citedOpen Access
Control-Flow Refinement for Complexity Analysis of Probabilistic Programs in KoAT
arXiv (Cornell University)·2024· 1 citedOpen Access
Integrating Loop Acceleration into Bounded Model Checking
arXiv (Cornell University)·2024· 3 citedOpen Access
Satisfiability Modulo Exponential Integer Arithmetic
Lecture notes in computer science·2024· 2 citedOpen Access
Integer Linear-Exponential Programming in NP by Quantifier Elimination
arXiv (Cornell University)·2024· 1 citedOpen Access
Control-Flow Refinement for Complexity Analysis of Probabilistic Programs in KoAT (Short Paper)
Lecture notes in computer science·2024· 4 citedOpen Access
A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting
Lecture notes in computer science·2024· 2 cited
page 1 of 11Next →

Frequent Co-authors

Peter Schneider–Kamp(22), René Thiemann(22), Carsten Fuhs(9), Marc Brockschmidt(9), Fabian Emmes(9), Stephan Falke(6), Carsten Otto(6), Thomas Arts(5), Aart Middeldorp(5), Thomas Ströder(5), Florian Frohn(3), Martin Plücker(3), Stephan Swiderski(3), Alexander Serebrenik(3), Harald Zankl(2), Jera Hensel(2), Stephanie Swiderski(2), Christian von Essen(2), Lars Noschinski(2), Albert Rubio(2)