December 19, 2014 conference-paper Open access

Probabilistic Termination

ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)

DOI: 10.1145/2676726.2677001 Full text (OA) OpenAlex

Authors 0

Author list not loaded yet.

Cited by 15 stored of 124

Generating Functions Meet Occupation Measures: Invariant Synthesis for Probabilistic Loops
2026 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

1

citations
Caesar: A Deductive Verifier for Probabilistic Programs
2026 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

0

citations
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

1

citations
Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
2024 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems

0

citations
From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting
2024 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

2

citations
A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting
2024 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems

2

citations
A Deductive Verification Infrastructure for Probabilistic Programs
2023 Proceedings of the ACM on Programming Languages article Computer Science Logic, programming, and type systems Open access

22

citations
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
The probabilistic termination tool amber
2022 Formal Methods in System Design article Computer Science Logic, programming, and type systems Open access

5

citations
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
2021 other Computer Science Logic, programming, and type systems

2

citations
Relatively complete verification of probabilistic programs: an expressive language for expectation-based reasoning
2021 Proceedings of the ACM on Programming Languages article Computer Science Logic, programming, and type systems Open access

33

citations
Automated Termination Analysis of Polynomial Probabilistic Programs
2021 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

31

citations
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
2021 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

20

citations
The Probabilistic Termination Tool Amber
2021 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems

15

citations
Relatively Complete Verification of Probabilistic Programs
2020 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

0

citations

15 results

Probabilistic Termination

Authors 0

Cited by 15 stored of 124

References 0