A Aralex Aachen research explorer

September 04, 2024 conference-paper Open access

On the Almost-Sure Termination of Binary Sessions

International Symposium on Principles and Practice of Declarative Programming (PPDP)

DOI: 10.1145/3678232.3678239 Full text (OA) OpenAlex

Authors 0

Author list not loaded yet.

Cited by 1 stored of 2

Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term Rewriting
2025 International Symposium on Principles and Practice of Declarative Programming (PPDP) conference-paper Computer Science Logic, programming, and type systems Open access

2

citations

1 result

References 1

Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
2023 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

7

citations

1 result