Dependability arguments with trusted bases

Author(s)
Kang, Eunsuk; Jackson, Daniel
Thumbnail
DownloadJackson_Dependability arguments.pdf (490.4Kb)
PUBLISHER_POLICY
Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
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.
Date issued
2010-11
URI
http://hdl.handle.net/1721.1/62031
Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Journal
Proceedings of the 2010 18th IEEE International Requirements Engineering Conference (RE)
Publisher
Institute of Electrical and Electronics Engineers
Citation
Eunsuk Kang, and D. Jackson. “Dependability Arguments with Trusted Bases.” Requirements Engineering Conference (RE), 2010 18th IEEE International. 2010. 262-271. © Copyright 2010 IEEE
Version: Final published version
Other identifiers
INSPEC Accession Number: 11653574
ISBN
978-1-4244-8022-7
ISSN
1090-705X
Collections