Compositional reverification of probabilistic safety properties for large-scale complex IT systems

  • Authors:
  • Radu Calinescu;Shinji Kikuchi;Kenneth Johnson

  • Affiliations:
  • Department of Computer Science, University of York, York, UK;Fujitsu Laboratories Limited, Kawasaki, Kanagawa, Japan;Department of Computer Science, University of York, York, UK

  • Venue:
  • Proceedings of the 17th Monterey conference on Large-Scale Complex IT Systems: development, operation and management
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Compositional verification has long been regarded as an effective technique for extending the use of symbolic model checking to large, component-based systems. This paper explores the effectiveness of the technique for large-scale complex IT systems (LSCITS). In particular, we investigate how compositional verification can be used to reverify LSCITS safety properties efficiently after the frequent changes that characterise these systems. We identify several LSCITS change patterns--including component failure, join and choice--and propose an approach that uses assume-guarantee compositional verification to reverify probabilistic safety properties compositionally in scenarios associated with these patterns. The application of this approach is illustrated using a case study from the area of cloud computing.