3 citations · 10 across the 10 of their papers we have counts for
10 papers
Disproving (Positive) Almost-Sure Termination of Probabilistic Term Rewriting via Random Walks
Jan-Christoph Kassing, Henri Nagel, Alexander Schlecht +1
In recent years, numerous techniques were developed to automatically prove termination of different kinds of probabilistic programs. However, there are only few automated methods t…
Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term Rewriting
Jan-Christoph Kassing, Leon Spitzer, Jürgen Giesl
The dependency pair (DP) framework is one of the most powerful techniques for automatic termination and complexity analysis of term rewrite systems. While DPs were extended to prov…
Weighted Rewriting: Semiring Semantics for Abstract Reduction Systems
Emma Ahrens, Jan-Christoph Kassing, Jürgen Giesl +1
We present novel semiring semantics for abstract reduction systems (ARSs). More precisely, we provide a weighted version of ARSs, where the reduction steps induce weights from a se…
The Annotated Dependency Pair Framework for Almost-Sure Termination of Probabilistic Term Rewriting
Jan-Christoph Kassing, Jürgen Giesl
Dependency pairs are one of the most powerful techniques to analyze termination of term rewrite systems automatically. We adapt dependency pairs to the probabilistic setting and de…
Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
Jan-Christoph Kassing, Jürgen Giesl
Dependency pairs (DPs) are one of the most powerful techniques for automated termination analysis of term rewrite systems. Recently, we adapted the DP framework to the probabilisti…
A Dependency Pair Framework for Relative Termination of Term Rewriting
Jan-Christoph Kassing, Grigory Vartanyan, Jürgen Giesl
Dependency pairs are one of the most powerful techniques for proving termination of term rewrite systems (TRSs), and they are used in almost all tools for termination analysis of T…
From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting
Jan-Christoph Kassing, Florian Frohn, Jürgen Giesl
There are many evaluation strategies for term rewrite systems, but proving termination automatically is usually easiest for innermost rewriting. Several syntactic criteria exist wh…
A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting
Jan-Christoph Kassing, Stefan Dollase, Jürgen Giesl
Recently, the well-known dependency pair (DP) framework was adapted to a dependency tuple framework in order to prove almost-sure innermost termination (iAST) of probabilistic term…
Dependency Tuples for Almost-Sure Innermost Termination of Probabilistic Term Rewriting (Short WST Version)
Jan-Christoph Kassing, Jürgen Giesl
Dependency pairs are one of the most powerful techniques to analyze termination of term rewrite systems (TRSs) automatically. We adapt the dependency pair framework to the probabil…
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
Jan-Christoph Kassing, Jürgen Giesl
Dependency pairs are one of the most powerful techniques to analyze termination of term rewrite systems (TRSs) automatically. We adapt the dependency pair framework to the probabil…