Resource Analysis driven by (Conditional) Termination Proofs

• Control-Flow Refinement for Complexity Analysis of Probabilistic Programs in KoAT (Short Paper)

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

  6

  citations
• Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs

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

  7

  citations
• Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops

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

  7

  citations
• Improving Automatic Complexity Analysis of Integer Programs

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

  10

  citations
• Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes

  2021 other Computer Science Logic, programming, and type systems

  2

  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
• Inferring Lower Runtime Bounds for Integer Programs

  2020 ACM Transactions on Programming Languages and Systems article Computer Science Logic, programming, and type systems Open access

  12

  citations
• Polynomial Loops: Beyond Termination

  2020 EPiC series in computing conference-paper Computer Science Logic, programming, and type systems Open access

  13

  citations

8 results