Compositional Reverification of Probabilistic Safety Properties for Large-Scale Complex IT Systems

  • Radu Calinescu
  • Shinji Kikuchi
  • Kenneth Johnson
Conference paper

DOI: 10.1007/978-3-642-34059-8_16

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7539)
Cite this paper as:
Calinescu R., Kikuchi S., Johnson K. (2012) Compositional Reverification of Probabilistic Safety Properties for Large-Scale Complex IT Systems. In: Calinescu R., Garlan D. (eds) Large-Scale Complex IT Systems. Development, Operation and Management. Monterey Workshop 2012. Lecture Notes in Computer Science, vol 7539. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Radu Calinescu
    • 1
  • Shinji Kikuchi
    • 2
  • Kenneth Johnson
    • 1
  1. 1.Department of Computer ScienceUniversity of YorkYorkUK
  2. 2.Fujitsu Laboratories LimitedKawasakiJapan

Personalised recommendations