Towards Abstraction-based Probabilistic Program Analysis

Dániel Szekeres; István Majzik

doi:10.14232/actacyb.298287

Dániel Szekeres Department of Measurement and Information Systems, Budapest University of Technology and Economics, Budapest, Hungary https://orcid.org/0000-0002-2912-028X
István Majzik Department of Measurement and Information Systems, Budapest University of Technology and Economics, Budapest, Hungary https://orcid.org/0000-0002-1184-2882

DOI: https://doi.org/10.14232/actacyb.298287

Keywords: probabilistic systems, stochastic games, abstraction, reliability analysis

Abstract

Probabilistic programs that can represent both probabilistic and non-deterministic choices are useful for creating reliability models of complex safety-critical systems that interact with humans or external systems. Such models are often quite complex, so their analysis can be hindered by state-space explosion. One common approach to deal with this problem is the application of abstraction techniques. We present improvements for an abstraction-refinement scheme for the analysis of probabilistic programs, aiming to improve the scalability of the scheme by adapting modern techniques from qualitative software model checking, and make the analysis result more reliable using better convergence checks. We implemented and evaluated the improvements in our Theta model checking framework.

Downloads

Download data is not yet available.