The annotated dependency pair framework for almost-sure termination of probabilistic term rewriting

Read full text
Authors: Jan-Christoph Kassing, Jürgen Giesl
Cited by: 0

Fields of Study & Subjects

Logic programming and type systems Formal Methods in Verification semigroups and automata theory

Publication details

Journal / source
Science of Computer Programming
Publication date
1 January 2026
Language
EN