From

Institution

Field

Type

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

Reset

Papers matching “termination verification” 41

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Dynamic Algorithm Termination for Branch-and-Bound-based Neural Network Verification
2025 Proceedings of the AAAI Conference on Artificial Intelligence conference-paper Computer Science Formal Methods in Verification Open access

Konstantin Kaulen, Holger H. Hoos

3

citations
A Deductive Verification Infrastructure for Probabilistic Programs
2023 Proceedings of the ACM on Programming Languages article Computer Science Logic, programming, and type systems Open access

Philipp Schröer, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja

22

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
On Certificates, Expected Runtimes, and Termination in Probabilistic Pushdown Automata
2023 Proceedings - Symposium on Logic in Computer Science conference-paper Computer Science Formal Methods in Verification

Joost-Pieter Katoen

5

citations
On Certificates, Expected Runtimes, and Termination in Probabilistic Pushdown Automata
2023 RWTH Publications (RWTH Aachen) conference-paper Computer Science Formal Methods in Verification Open access

Joost-Pieter Katoen

0

citations
Expected Runtime Analyis by Program Verification
2020 Cambridge University Press eBooks book-chapter Computer Science Logic, programming, and type systems

Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja

12

citations
Automated Termination Proofs for C Programs with Lists (Short WST Version)
2023 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jera Hensel, Jürgen Giesl

0

citations
Probabilistic Program Verification via Inductive Synthesis of Inductive Invariants
2022 RWTH Publications (RWTH Aachen) conference-paper Computer Science Formal Methods in Verification Open access

Kevin Batz, Mingshuai Chen, Sebastian Junges, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja

0

citations
A calculus for modular loop acceleration and non-termination proofs
2022 International Journal on Software Tools for Technology Transfer article Computer Science Logic, programming, and type systems 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
Relatively complete verification of probabilistic programs: an expressive language for expectation-based reasoning
2021 Proceedings of the ACM on Programming Languages article Computer Science Logic, programming, and type systems Open access

Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja

33

citations
Relatively Complete Verification of Probabilistic Programs
2020 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja

0

citations
Proving Non-Termination by Acceleration Driven Clause Learning
2023 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Florian Frohn, Jürgen Giesl

2

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

Florian Frohn, Jürgen Giesl

6

citations
Proving Non-Termination by Acceleration Driven Clause Learning (Short WST Version)
2023 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Florian Frohn, Jürgen Giesl

0

citations
Termination of triangular polynomial loops
2025 Formal Methods in System Design article Computer Science Formal Methods in Verification Open access

Marcel Hark, Florian Frohn, Jürgen Giesl

0

citations
Sound and complete proof rules for almost-sure termination: from probabilistic control-flow graphs to program-level reasoning
2026 RWTH Publications (RWTH Aachen) dissertation Computer Science Logic, programming, and type systems Open access

Jonas Seidel

0

citations
Probabilistic Program Verification via Inductive Synthesis of Inductive Invariants
2023 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access

Kevin Batz, Mingshuai Chen, Sebastian Junges, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja

33

citations
Methoden für die automatische Komplexitäts- und Terminierungsanalyse von (probabilistischen) Programmen und ihre Vollständigkeit
2021 RWTH Publications (RWTH Aachen) dissertation Computer Science Logic, programming, and type systems Open access

Marcel Hark

1

citations
Programmatic Strategy Synthesis: Resolving Nondeterminism in Probabilistic Programs
2023 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Kevin Batz, Tom Jannik Biskup, Joost-Pieter Katoen, Tobias Winkler

1

citations
Hitching a Ride to a Lasso: Massively Parallel On-The-Fly LTL Model Checking
2024 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access

Muhammad Osama, Anton Wijs

4

citations
Accelerated bounded model checking with LoAT
2026 Science of Computer Programming article Computer Science Formal Methods in Verification Open access

Florian Frohn, Jürgen Giesl

0

citations
On Deciding Constant Runtime of Linear Loops
2026 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Florian Frohn, Jürgen Giesl, Peter Giesl, Nils Lommen

0

citations
On Deciding Constant Runtime of Linear Loops
2026 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Florian Frohn, Jürgen Giesl, Peter Giesl, Nils Lommen

0

citations
Programmatic Strategy Synthesis: Resolving Nondeterminism in Probabilistic Programs
2024 Proceedings of the ACM on Programming Languages article Computer Science Logic, programming, and type systems Open access

Kevin Batz, Tom Jannik Biskup, Joost-Pieter Katoen, Tobias Winkler

11

citations