Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term Rewriting
by J.-C. Kassing, L. Spitzer, J. Giesl. In Proceedings of the 27th International Symposium on Principles and Practice of Declarative Programming (PPDP 2025), Rende, Italy, Proceedings of the 27th International Symposium on Principles and Practice of Declarative Programming, Articel 10, 2025.
Download Paper | Extended Version | Download Slides | Evaluation Website