The annotated dependency pair framework for almost-sure termination of probabilistic term rewriting

2026/06/01 by Jan-Christoph Kassing, Jürgen Giesl

paper · doi:10.1016/j.scico.2025.103417

Citations

• Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
• A Dependency Pair Framework for Relative Termination of Term Rewriting
• From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting
• Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
• Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms