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

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kassing, Jan-Christoph, Spitzer, Leon, Giesl, Jürgen
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2507.12918