A framework for verification of software with time and probabilities

Kwiatkowska, M., Norman, G. and Parker, D. (2010) A framework for verification of software with time and probabilities. Lecture Notes in Computer Science, 6246, pp. 25-45. (doi:10.1007/978-3-642-15297-9_4)

Full text not currently available from Enlighten.

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.

Item Type:Articles
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Norman, Dr Gethin
Authors: Kwiatkowska, M., Norman, G., and Parker, D.
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Lecture Notes in Computer Science
Publisher:Springer
ISSN:0302-9743
ISSN (Online):1611-3349

University Staff: Request a correction | Enlighten Editors: Update this record