A safety-focused verification using software fault trees
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cha, Sungdeok | - |
dc.contributor.author | Yoo, Junbeom | - |
dc.date.accessioned | 2021-09-06T14:46:10Z | - |
dc.date.available | 2021-09-06T14:46:10Z | - |
dc.date.created | 2021-06-15 | - |
dc.date.issued | 2012-10 | - |
dc.identifier.issn | 0167-739X | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/107254 | - |
dc.description.abstract | When developing safety-critical software such as reactor protection systems (RPS) in nuclear power plants, a demonstration of software trust (e.g., safety) is not only absolutely essential but also usually mandated by government authorities. While automated generation of fault trees has become possible with increased use of formal specifications, industrial use of fault trees has been limited primarily to safety demonstrations that the system is free from behavior captured in the root node. In this paper, we propose to extend the use of automated fault tree for verification purposes. As a fault tree represents an abstract and partial behavioral model of software on credible causes leading to a hazard, it must still satisfy various properties (e.g., fairness, correctness). Verification of a fault tree is useful when developing safety-critical software because (1) it strengthens a safety-focused software development process; (2) it provides an opportunity to detect potentially critical errors early; and (3) it is less likely to experience a state explosion problem. This paper demonstrates how to convert a fault tree into a semantically equivalent logic formula so that they can be subject to formal verification using tools like Verification Interacting with Synthesis (VIS). We evaluated the feasibility of FTA's applicability as a verification tool on a prototype model of a nuclear power reactor protection system (RPS) software to be deployed in plants under construction in Korea. Crown Copyright (C) 2011 Published by Elsevier B.V. All rights reserved. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER | - |
dc.subject | REQUIREMENTS SPECIFICATION | - |
dc.subject | SYSTEMS | - |
dc.subject | MODEL | - |
dc.title | A safety-focused verification using software fault trees | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Cha, Sungdeok | - |
dc.identifier.doi | 10.1016/j.future.2011.02.004 | - |
dc.identifier.scopusid | 2-s2.0-84862178720 | - |
dc.identifier.wosid | 000306888400011 | - |
dc.identifier.bibliographicCitation | FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, v.28, no.8, pp.1272 - 1282 | - |
dc.relation.isPartOf | FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE | - |
dc.citation.title | FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE | - |
dc.citation.volume | 28 | - |
dc.citation.number | 8 | - |
dc.citation.startPage | 1272 | - |
dc.citation.endPage | 1282 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.subject.keywordPlus | REQUIREMENTS SPECIFICATION | - |
dc.subject.keywordPlus | SYSTEMS | - |
dc.subject.keywordPlus | MODEL | - |
dc.subject.keywordAuthor | Safety analysis | - |
dc.subject.keywordAuthor | Software fault tree | - |
dc.subject.keywordAuthor | Software verification | - |
dc.subject.keywordAuthor | Combinational equivalence checking | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.