From

Institution

Field

Type

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

Reset

Papers matching “termination verification” 10

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

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
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
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 WST Version)
2023 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Florian Frohn, Jürgen Giesl

0

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
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
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
Foundations for Entailment Checking in Quantitative Separation Logic (extended version)
2022 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Kevin Batz, Ira Fesefeldt, Marvin Jansen, Joost-Pieter Katoen, Florian Keßler, Christoph Matheja, +1 more

0

citations

10 results