Work

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

Year: 2023

Type: conference-paper

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.

Source: RWTH Publications (RWTH Aachen)

DOI: 10.48550/arxiv.2305.11741

Authors: Kassing, Jan-Christoph, Giesl, Jürgen

Institution: RWTH Aachen University

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Deutsche Forschungsgemeinschaft

Award: Automatische Terminierungs und Komplexitätsanalyse imperativer Programme