AI Chat AI Image Generator AI Video Text to Speech

Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes

10/13/2020

∙

by Fabian Meyer, et al.

∙

∙

We present a novel modular approach to infer upper bounds on the expected runtime of probabilistic integer programs automatically. To this end, it computes bounds on the runtime of program parts and on the sizes of their variables in an alternating way. To evaluate its power, we implemented our approach in a new version of our open-source tool KoAT.

Fabian Meyer
8 publications
Marcel Hark
5 publications
Jürgen Giesl
21 publications

page 1

page 2

page 3

page 4

research

∙ 07/19/2023

Automated Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops (Short WST Version)

There exist several results on deciding termination and computing runtim...

0 Nils Lommen, et al. ∙

research

∙ 05/23/2019

Computing Expected Runtimes for Constant Probability Programs

We introduce the class of constant probability (CP) programs and show th...

0 Jürgen Giesl, et al. ∙

research

∙ 05/18/2022

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

There exist several results on deciding termination and computing runtim...

0 Nils Lommen, et al. ∙

research

∙ 11/25/2019

Runtime Analysis of Quantum Programs: A Formal Approach

In this extended abstract we provide a first step towards a tool to esti...

0 Federico Olmedo, et al. ∙

research

∙ 07/13/2023

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

We present a new procedure to infer size bounds for integer programs aut...

0 Nils Lommen, et al. ∙

research

∙ 11/04/2019

Inferring Lower Runtime Bounds for Integer Programs

We present a technique to infer lower bounds on the worst-case runtime c...

0 Florian Frohn, et al. ∙

research

∙ 11/28/2019

Expected Runtime of Quantum Programs

Building upon recent work on probabilistic programs, we formally define ...

0 Junyi Liu, et al. ∙