Author: Meyer, Fabian; Hark, Marcel; Giesl, Jürgen
Title: Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes Cord-id: jgl7kuf2 Document date: 2021_3_1
ID: jgl7kuf2
Snippet: We present a novel modular approach to infer upper bounds on the expected runtimes of probabilistic integer programs automatically. To this end, it computes bounds on the runtimes 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.
Document: We present a novel modular approach to infer upper bounds on the expected runtimes of probabilistic integer programs automatically. To this end, it computes bounds on the runtimes 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.
Search related documents:
Co phrase search for related documents- Try single phrases listed below for: 1
Co phrase search for related documents, hyperlinks ordered by date