A Formal Basis for Safety Case Patterns

  • Ewen Denney
  • Ganesh Pai
Conference paper

DOI: 10.1007/978-3-642-40793-2_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8153)
Cite this paper as:
Denney E., Pai G. (2013) A Formal Basis for Safety Case Patterns. In: Bitsch F., Guiochet J., Kaâniche M. (eds) Computer Safety, Reliability, and Security. SAFECOMP 2013. Lecture Notes in Computer Science, vol 8153. Springer, Berlin, Heidelberg

Abstract

By capturing common structures of successful arguments, safety case patterns provide an approach for reusing strategies for reasoning about safety. In the current state of the practice, patterns exist as descriptive specifications with informal semantics, which not only offer little opportunity for more sophisticated usage such as automated instantiation, composition and manipulation, but also impede standardization efforts and tool interoperability. To address these concerns, this paper gives (i) a formal definition for safety case patterns, clarifying both restrictions on the usage of multiplicity and well-founded recursion in structural abstraction, (ii) formal semantics to patterns, and (iii) a generic data model and algorithm for pattern instantiation. We illustrate our contributions by application to a new pattern, the requirements breakdown pattern, which builds upon our previous work.

Keywords

Safety cases Safety case patterns Formal methods Automation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Ewen Denney
    • 1
  • Ganesh Pai
    • 1
  1. 1.SGT / NASA Ames Research CenterMoffett FieldUSA

Personalised recommendations