Dependability arguments with trusted bases
An approach is suggested for arguing that a system is dependable. The key idea is to structure the system so that critical requirements are localized in small, reliable subsets of the system's components called trusted bases. This paper describes an idiom for modeling systems with trusted bases...
Main Authors: | Kang, Eunsuk, Jackson, Daniel |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers
2011
|
Online Access: | http://hdl.handle.net/1721.1/62031 https://orcid.org/0000-0002-0194-3989 https://orcid.org/0000-0003-4864-078X |
Similar Items
Similar Items
-
Patterns for building dependable systems with trusted bases
by: Kang, Eunsuk, et al.
Published: (2014) -
A Framework for Dependability analysis of software systems with trusted bases
by: Kang, Eunsuk
Published: (2010) -
Separation of concerns for dependable software design
by: Jackson, Daniel, et al.
Published: (2011) -
Property-part diagrams: A dependence notation for software systems
by: Jackson, Daniel, et al.
Published: (2011) -
A lightweight code analysis and its role in evaluation of a dependability case
by: Near, Joseph Paul, et al.
Published: (2012)