The Annotated Dependency Pair Framework for Almost-Sure Termination of Probabilistic Term Rewriting
Logic in Computer Science
2025-06-09 v2
Abstract
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 develop an annotated dependency pair framework for automatically proving almost-sure termination of probabilistic term rewrite systems, both for full and innermost rewriting. To evaluate its power, we implemented our framework in the tool AProVE.
Keywords
Cite
@article{arxiv.2412.20220,
title = {The Annotated Dependency Pair Framework for Almost-Sure Termination of Probabilistic Term Rewriting},
author = {Jan-Christoph Kassing and Jürgen Giesl},
journal= {arXiv preprint arXiv:2412.20220},
year = {2025}
}
Comments
Extended journal version of arXiv:2309.00344 and arXiv:2408.06768