Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting

Jan-Christoph Kassing, Jürgen Giesl. Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting. In Nils Jansen 0001, Sebastian Junges, Benjamin Lucien Kaminski, Christoph Matheja, Thomas Noll 0001, Tim Quatmann, Mariëlle Stoelinga, Matthias Volk 0001, editors, Principles of Verification: Cycling the Probabilistic Landscape - Essays Dedicated to Joost-Pieter Katoen on the Occasion of His 60th Birthday, Part I. Volume 15260 of Lecture Notes in Computer Science, pages 339-366, Springer, 2025. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.