Probabilistic Program Verification via Inductive Synthesis of Inductive Invariants

Lecture notes in computer science, pp. 410–429

Abstract

Abstract Essential tasks for the verification of probabilistic programs include bounding expected outcomes and proving termination in finite expected runtime. We contribute a simple yet effective inductive synthesis approach for proving such quantitative reachability properties by generating inductive invariants on source-code level . Our implementation shows promise: It finds invariants for (in)finite-state programs, can beat state-of-the-art probabilistic model checkers, and is competitive with modern tools dedicated to invariant synthesis and expected runtime reasoning.

Authors 6

1. Kevin Batz corresponding Aachen

   RWTH Aachen University

   Affiliation as printed

   RWTH Aachen University, Aachen, Germany

2. Mingshuai Chen corresponding

   Zhejiang University

   Affiliation as printed

   Zhejiang University, Hangzhou, China

3. Sebastian Junges

   Radboud University Nijmegen

   Affiliation as printed

   Radboud University, Nijmegen, Netherlands

4. Benjamin Lucien Kaminski corresponding

   University College London · Saarland University

   Affiliation as printed

   Saarland University, Saarbrücken, Germany

   University College London, London, United Kingdom

5. Joost-Pieter Katoen corresponding Aachen

   RWTH Aachen University

   Affiliation as printed

   RWTH Aachen University, Aachen, Germany

6. Christoph Matheja corresponding

   Technical University of Denmark

   Affiliation as printed

   Technical University of Denmark, Kgs. Lyngby, Denmark