Cost Analysis of Nondeterministic Probabilistic Programs

Anonymous, 1 and Anonymous, 2 and Anonymous, 3 and Anonymous, 4 and Anonymous, 5 and Anonymous, 6 (2018) Cost Analysis of Nondeterministic Probabilistic Programs. Technical Report. IST Austria.

[img] Text
techreport.pdf - Published Version
Download (3926Kb)
[img] Text
Restricted to Repository staff only
Download (322b)


We consider the problem of expected cost analysis over nondeterministic probabilistic programs, which aims at automated methods for analyzing the resource-usage of such programs. Previous approaches for this problem could only handle nonnegative bounded costs. However, in many scenarios, such as queuing networks or analysis of cryptocurrency protocols, both positive and negative costs are necessary and the costs are unbounded as well. In this work, we present a sound and efficient approach to obtain polynomial bounds on the expected accumulated cost of nondeterministic probabilistic programs. Our approach can handle (a) general positive and negative costs with bounded updates in variables; and (b) nonnegative costs with general updates to variables. We show that several natural examples which could not be handled by previous approaches are captured in our framework. Moreover, our approach leads to an efficient polynomial-time algorithm, while no previous approach for cost analysis of probabilistic programs could guarantee polynomial runtime. Finally, we show the effectiveness of our approach by presenting experimental results on a variety of programs, motivated by real-world applications, for which we efficiently synthesize tight resource-usage bounds.

Item Type: Monograph (Technical Report)
Subjects: 000 Computer science, knowledge & general works > 000 Computer science, knowledge & systems
Depositing User: Patrick Danowski
Date Deposited: 21 Nov 2018 15:51
Last Modified: 16 Jul 2019 22:40

Actions (login required)

View Item View Item