A Framework for Verification of Software with Time and Probabilities

[KNP10b] Marta Kwiatkowska, Gethin Norman and David Parker. A Framework for Verification of Software with Time and Probabilities. In Proc. 8th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'10), volume 6246 of LNCS, pages 25-45, Springer. September 2010. pdf bib [Extends PRISM's game-based abstraction-refinement methods for PTAs, to real-time probabilistic programs with data.]

Downloads
PDF 706 KBBibTeX
Notes
The original publication is available at link.springer.com.
Search for this paper
Google · Google Scholar

Abstract

Quantitative verification techniques are able to establish system properties such as "the probability of an airbag failing to deploy on demand'' or "the expected time for a network protocol to successfully send a message packet''. In this paper, we describe a framework for quantitative verification of software that exhibits both real-time and probabilistic behaviour. The complexity of real software, combined with the need to capture precise timing information, necessitates the use of abstraction techniques. We outline a quantitative abstraction refinement approach, which can be used to automatically construct and analyse abstractions of probabilistic, real-time programs. As a concrete example of the potential applicability of our framework, we discuss the challenges involved in applying it to the quantitative verification of SystemC, an increasingly popular system-level modelling language.