Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs-Reference-Cited by-同舟云学术

Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs

Published:2023 Issue: Volume: Page:344-364
ISSN:0302-9743
Container-title:Automated Deduction – CADE 29
language:
Short-container-title:

Author:

Kassing Jan-Christoph^ORCID,Giesl Jürgen^ORCID

Abstract

AbstractDependency 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 .

Publisher

Springer Nature Switzerland

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-38499-8_20

Reference40 articles.

1. Agrawal, S., Chatterjee, K., Novotný, P.: Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. Proc. ACM Program. Lang. 2(POPL), 1–32 (2017). https://doi.org/10.1145/3158122

2. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theor. Comput. Sci. 236(1–2), 133–178 (2000). https://doi.org/10.1016/S0304-3975(99)00207-8

3. Avanzini, M., Dal Lago, U., Yamada, A.: On probabilistic term rewriting. Sci. Comput. Program. 185 (2020). https://doi.org/10.1016/j.scico.2019.102338

4. Avanzini, M., Moser, G., Schaper, M.: A modular cost analysis for probabilistic programs. Proc. ACM Program. Lang. 4(OOPSLA), 1–30 (2020). https://doi.org/10.1145/3428240

5. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998). https://doi.org/10.1017/CBO9781139172752

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Almost-Sure Termination of Binary Sessions;Proceedings of the 26th International Symposium on Principles and Practice of Declarative Programming;2024-09-09

2. A Dependency Pair Framework for Relative Termination of Term Rewriting;Lecture Notes in Computer Science;2024

3. A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting;Lecture Notes in Computer Science;2024

4. From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting;Lecture Notes in Computer Science;2024