A new proof rule for almost-sure termination

• Highly Incremental: A Simple Programmatic Approach for Many Objectives

  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
• J-P: MDP. FP. PP

  2024 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

  2

  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
• Does a Program Yield the Right Distribution?

  2022 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access

  14

  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
• Generating Functions for Probabilistic Programs

  2021 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

  9

  citations
• Foundations of probabilistic programming

  2021 RWTH Publications (RWTH Aachen) book Computer Science Logic, programming, and type systems Open access

  0

  citations
• Expected Runtime Analyis by Program Verification

  2020 Cambridge University Press eBooks book-chapter Computer Science Logic, programming, and type systems

  12

  citations

19 results