Title :
Dependability Arguments with Trusted Bases
Author :
Kang, Eunsuk ; Jackson, Daniel
Author_Institution :
Comput. Sci. & Artificial Intell. Lab., Massachusetts Inst. of Technol., Cambridge, MA, USA
fDate :
Sept. 27 2010-Oct. 1 2010
Abstract :
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, and a technique for analyzing a dependability argument-the argument that a trusted base is sufficient to establish a requirement.
Keywords :
security of data; critical requirements; dependability argument; dependability arguments; reliable subsets; trusted bases; Analytical models; Computer network reliability; Computers; Metals; Receivers; Security; Software; dependability; formal modeling and analysis; requirements and design; trusted bases;
Conference_Titel :
Requirements Engineering Conference (RE), 2010 18th IEEE International
Conference_Location :
Sydney, NSW
Print_ISBN :
978-1-4244-8022-7
