From

Institution

Field

Type

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

Reset

Papers matching “AProVE” 16

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

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
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
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
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
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 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 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
A Dependency Pair Framework for Relative Termination of Term Rewriting
2024 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

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
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
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
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
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
2024 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems

Jan-Christoph Kassing, Stefan Dollase, Jürgen Giesl

2

citations
Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
2024 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems

Jan-Christoph Kassing, Jürgen Giesl

0

citations

16 results