Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term Rewriting

International Symposium on Principles and Practice of Declarative Programming (PPDP), pp. 1–14

Abstract

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 prove almost-sure termination of probabilistic term rewrite systems (PTRSs), automatic complexity analysis for PTRSs is largely unexplored. Weintroduce the first DP framework for analyzing expected complexity and for proving positive or strong almost-sure termination (\(\operatorname{\texttt{SAST}}\))of innermost rewriting with PTRSs, i.e., finite expected runtime. We implemented our framework in the tool AProVE and demonstrate its power compared to existing techniques for proving \(\operatorname{\texttt{SAST}}\).

Authors 0

1. Author list not loaded yet.