From

Institution

Field

Type

Topic: Logic, programming, and type systems ×

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

Reset

Papers matching “program termination” in Logic, programming, and type systems 48

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

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
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
A Calculus for Modular Loop Acceleration and Non-Termination Proofs
2021 BIROn (Birkbeck, University of London) article Computer Science Logic, programming, and type systems Open access

Florian Frohn, Carsten Fuhs

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 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
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
AProVE: Non-Termination Witnesses for C Programs
2022 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Jera Hensel, Constantin Mensendiek, Jürgen Giesl

10

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
KoAT: Automatic Complexity and Termination Analysis of Integer Programs
2026 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems 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 Logic, programming, and type systems Open access

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

0

citations
KoAT: Automatic Complexity and Termination Analysis of Integer Programs
2026 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Nils Lommen, Fabian Meyer, Jürgen Giesl

0

citations
Implementation of a predicate-guided termination snalysis for pointer programs
2020 RWTH Publications (RWTH Aachen) article Computer Science Logic, programming, and type systems Open access

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
Polynomial Loops: Beyond Termination
2020 EPiC series in computing conference-paper Computer Science Logic, programming, and type systems Open access

Marcel Hark, Florian Frohn, Jürgen Giesl

13

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
AProVE: Modular Termination Analysis of Memory-Manipulating C Programs
2023 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Frank Emrich, Jera Hensel, Jürgen Giesl

1

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
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description)
2022 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Florian Frohn, Jürgen Giesl

0

citations
Deciding Termination of Simple Randomized Loops
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Logic, programming, and type systems Open access

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
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description)
2022 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Florian Frohn, Jürgen Giesl

16

citations
AProVE (KoAT + LoAT)
2025 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Nils Lommen, Jürgen Giesl

5

citations