From

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Reset

Papers matching “termination analysis” 220

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

Automated Termination Analysis of Polynomial Probabilistic Programs
2020 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen, Laura Kovács

0

citations
AProVE: Modular Termination Analysis of Memory-Manipulating C Programs
2023 arXiv (Cornell University) preprint Computer Science Parallel Computing and Optimization Techniques Open access

Frank Emrich, Jera Hensel, Jürgen Giesl

1

citations
Automated Termination Analysis of Polynomial Probabilistic Programs
2021 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access

Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen, Laura Kovács

31

citations
Verifying LTL for Infinite State Systems via Termination Analysis
2026 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Nils Lommen, Moritz Leven Rosarius, Jürgen Giesl

0

citations
KoAT: Automatic Complexity and Termination Analysis of Integer Programs
2026 Lecture notes in computer science conference-paper Open access

Nils Lommen, Fabian Meyer, Jürgen Giesl

0

citations
KoAT: Automatic Complexity and Termination Analysis of Integer Programs
2026 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Nils Lommen, Éléanore Meyer, Jürgen Giesl

0

citations
KoAT: Automatic Complexity and Termination Analysis of Integer Programs
2026 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Nils Lommen, Éléanore Meyer, Jürgen Giesl

0

citations
KoAT: Automatic Complexity and Termination Analysis of Integer Programs
2026 Zenodo (CERN European Organization for Nuclear Research) software Open access

Nils Lommen, Éléanore Meyer, Jürgen Giesl

1

citations
KoAT: Automatic Complexity and Termination Analysis of Integer Programs
2026 RWTH Publications (RWTH Aachen) article Computer Science Formal Methods in Verification Open access

Nils Michael Lommen, Éléanore Marie Meyer, Jürgen Giesl

0

citations
KoAT: Automatic Complexity and Termination Analysis of Integer Programs
2026 Zenodo (CERN European Organization for Nuclear Research) software Open access

Nils Lommen, Éléanore Meyer, Jürgen Giesl

0

citations
Disproving (Positive) Almost-Sure Termination of Probabilistic Term Rewriting via Random Walks
2026 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Henri Nagel, Alexander Schlecht, Jürgen Giesl

1

citations
Disproving (Positive) Almost-Sure Termination of Probabilistic Term Rewriting via Random Walks
2026 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Henri Nagel, Alexander Schlecht, Jürgen Giesl

0

citations
Disproving (Positive) Almost-Sure Termination of Probabilistic Term Rewriting via Random Walks
2026 Lecture notes in computer science conference-paper Open access

Jan-Christoph Kassing, H. Nagel, A. Schlecht, Jürgen Giesl

0

citations
Proving Termination of C Programs with Lists
2023 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Jera Hensel, Jürgen Giesl

2

citations
Automated Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops (Short WST Version)
2023 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Nils Lommen, Jürgen Giesl

0

citations
Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
2022 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Nils Lommen, Fabian Meyer, Jürgen Giesl

7

citations
Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
2024 arXiv (Cornell University) preprint Computer Science Natural Language Processing Techniques Open access

Jan-Christoph Kassing, Jürgen Giesl

1

citations
Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
2022 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Nils Lommen, Jürgen Giesl

1

citations
Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term Rewriting
2025 International Symposium on Principles and Practice of Declarative Programming (PPDP) conference-paper Computer Science Logic, programming, and type systems Open access

1

citations
A Dependency Pair Framework for Relative Termination of Term Rewriting
2024 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

2

citations
A Dependency Pair Framework for Relative Termination of Term Rewriting
2024 arXiv (Cornell University) preprint Computer Science Natural Language Processing Techniques Open access

Jan-Christoph Kassing, Jürgen Giesl

1

citations
A calculus for modular loop acceleration and non-termination proofs
2022 International Journal on Software Tools for Technology Transfer article Computer Science Formal Methods in Verification Open access

Florian Frohn, Carsten Fuhs

8

citations
Proving Termination of C Programs with Lists
2023 RWTH Publications (RWTH Aachen) conference-paper Computer Science Logic, programming, and type systems Open access

Jera Hensel, Jürgen Giesl

1

citations
Improving Automatic Complexity Analysis of Integer Programs
2022 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Jürgen Giesl, Nils Lommen, Marcel Hark

0

citations
Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper)
2023 Lecture notes in computer science conference-paper Computer Science Software Engineering Research Open access

Florian Frohn, Jürgen Giesl

6

citations