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

23Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

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. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Calinescu, R., Kikuchi, S., & Johnson, K. (2012). Compositional reverification of probabilistic safety properties for large-scale complex IT systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7539 LNCS, pp. 303–329). https://doi.org/10.1007/978-3-642-34059-8_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free