A framework for verification of software with time and probabilities

  • Authors:
  • Marta Kwiatkowska;Gethin Norman;David Parker

  • Affiliations:
  • Oxford University Computing Laboratory, Oxford, UK;Department of Computing Science, University of Glasgow, Glasgow, UK;Oxford University Computing Laboratory, Oxford, UK

  • Venue:
  • FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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.