Advanced weakest precondition calculi for probabilistic programs

  • Erweiterte wp-Kalküle für Probabilistische Programme

Kaminski, Benjamin Lucien; Katoen, Joost-Pieter (Thesis advisor); McIver, Annabelle (Thesis advisor)

Aachen (2019)
Dissertation / PhD Thesis

Dissertation, RWTH Aachen University, 2019

Abstract

We study quantitative reasoning about probabilistic programs. In doing so, we investigate two main aspects: The reasoning techniques themselves and the computational hardness of that reasoning. As for the former aspect, we first give a comprehensive introduction to weakest preexpectation reasoning à la McIver & Morgan - a reasoning technique for the verification of probabilistic programs that builds on Dijkstra's weakest precondition calculus for programs with nondeterminism and Kozen's probabilistic propositional dynamic logic for probabilistic programs. We then develop advanced weakest-preexpectation-style calculi for probabilistic programs that enable reasoning about - expected runtimes, - conditional expected values and conditional probabilities, and - expected values of mixed-sign random variables. As with Dijkstra's calculus, our calculi are defined inductively on the program structure and thus allow for compositional reasoning on source code level. We put a special emphasis on proof rules for reasoning about loops. The second aspect we study is the inherent computational hardness of reasoning about probabilistic programs, which is independent from the employed analysis technique. In particular, we study the hardness of approximating expected values and (co)variances. We show that lower bounds on expected values are not computable but computably enumerable, whereas upper bounds are not computably enumerable. For covariances, we show that neither lower nor upper bounds are computably enumerable. Furthermore, we study the hardness of deciding termination of probabilistic programs. While we study different notions of probabilistic termination, for instance almost-sure termination or termination within finite expected time (also known as positive almost-sure termination), we show that deciding termination of probabilistic programs is generally strictly harder than deciding termination of nonprobabilistic programs.

Institutions

  • Department of Computer Science [120000]
  • UnRAVeL Research Training Group [080060]
  • Chair of Computer Science 2 (Software Modeling and Verification) [121310]

Identifier

Downloads