Dependency Tuples for Almost-Sure Innermost Termination of Probabilistic Term Rewriting (Short WST Version)
Logic in Computer Science
2023-07-20 v1
Abstract
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 probabilistic setting in order to prove almost-sure innermost termination of probabilistic TRSs. To evaluate its power, we implemented the new framework in our tool AProVE.
Keywords
Cite
@article{arxiv.2307.10002,
title = {Dependency Tuples for Almost-Sure Innermost Termination of Probabilistic Term Rewriting (Short WST Version)},
author = {Jan-Christoph Kassing and Jürgen Giesl},
journal= {arXiv preprint arXiv:2307.10002},
year = {2023}
}
Comments
Presented at WST 2023, short version of arXiv:2305.11741