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