From

Institution

Field

Type

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

Reset

Papers matching “almost-sure termination” 29

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting
2023 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Florian Frohn, Jürgen Giesl

2

citations
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
2023 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

7

citations
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
2023 RWTH Publications (RWTH Aachen) conference-paper Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

1

citations
From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting
2024 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Florian Frohn, Jürgen Giesl

2

citations
Disproving (Positive) Almost-Sure Termination of Probabilistic Term Rewriting via Random Walks
2026 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

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

0

citations
From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity
2024 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, 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
Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
2024 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

1

citations
The Annotated Dependency Pair Framework for Almost-Sure Termination of Probabilistic Term Rewriting
2024 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

0

citations
Dependency Tuples for Almost-Sure Innermost Termination of Probabilistic Term Rewriting (Short WST Version)
2023 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, 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
A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting
2023 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing

3

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
The annotated dependency pair framework for almost-sure termination of probabilistic term rewriting
2026 Science of Computer Programming article Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

0

citations
From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity
2025 Logical Methods in Computer Science article Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

0

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
Automated Termination Analysis of Polynomial Probabilistic Programs
2020 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

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

0

citations
Automated Termination Analysis of Polynomial Probabilistic Programs
2021 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

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

31

citations
The probabilistic termination tool amber
2022 Formal Methods in System Design article Computer Science Logic, programming, and type systems Open access

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

5

citations
The Probabilistic Termination Tool Amber
2021 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

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

0

citations
Does a Program Yield the Right Distribution?
2022 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access

Mingshuai Chen, Joost-Pieter Katoen, Lutz Klinkenberg, Tobias Winkler

14

citations
Preface
2020 other Computer Science Logic, programming, and type systems Open access

Gilles Barthe, Joost-Pieter Katoen, Alexandra Silva

0

citations
Generating Functions Meet Occupation Measures: Invariant Synthesis for Probabilistic Loops
2026 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Darion Haase, Kevin Batz, Adrian Gallus, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Lutz Klinkenberg, +1 more

1

citations
Does a Program Yield the Right Distribution? Verifying Probabilistic Programs via Generating Functions
2022 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Mingshuai Chen, Joost-Pieter Katoen, Lutz Klinkenberg

1

citations