期刊文献+

一种基于操作表达式模型的关键软件安全性验证方法研究

A Approach for Critical Software Safety Verification Based on Operation Expression Model
下载PDF
导出
摘要 目前在安全关键领域,软件系统的安全性分析与验证已经成为软件工程研究中的热点问题,本文工作给出一种基于镜像理论中操作表达式模型的关键软件安全性的验证方法.设计了从操作表达式模型到其分析树的自动转换方法;采用镜像理论的语义公理、定理及计算规则对分析树节点进行语义谓词计算,从而得到完整的附有语义谓词的语义树;使用镜像理论的定理证明规则验证语义树中各节点需要满足的安全性质规约;还给出了相应的原型工具和验证实例分析;此方法已在航空航天领域得到实际应用. In the field of safety critical,software systems analysis and verification has become a very important hotspot in the software engineering research. This paper is based on the Mirror Theory,and give a safety verification method. Specially,the analysis tree is created based on the operation expression,and then the semantic predicate of each node in the tree is generated by the semantic axioms,theorems and some calculated rules. Secondly,the result of programs safety is obtained by verifying the corresponding specification with the logic of Mirror Theory. Finally,a tool and example are given to demonstrate its value,and this approach has been applied in the aerospace and astronautics field.
出处 《小型微型计算机系统》 CSCD 北大核心 2014年第7期1578-1584,共7页 Journal of Chinese Computer Systems
基金 国家自然科学基金项目(61272083 61202002)资助 中国博士后科学基金项目(20110491411)资助 江苏省普通高校研究生科研创新计划项目(CXZZ11_0218)资助 中央高校基本科研业务费专项资金项目(CXZZ11_0218)资助
关键词 软件分析 安全性验证 操作表达式 镜像理论 语义树 software analysis safety verification operation expression(OE) mirror theory senmatic tree
  • 相关文献

参考文献7

二级参考文献79

  • 1袁崇义,赵文,张世琨,黄雨.A Three-Layer Model for Business Processes-Process Logic,Case Semantics and Workflow Management[J].Journal of Computer Science & Technology,2007,22(3):410-425. 被引量:8
  • 2Fenkam p, Jazayeri M, Reif G. On methodogies for constructing correct event-based applications [C] //Proc of the 3rd Int Workshop on Distributed Event Based Systems. New York: Software Engineering. 2004:38-42
  • 3Satyaki D, David L D, Seungjoon P. Experience with predicate abstraction[C] //Proc of the 11th Int Conf on Computer-Aided Verication. New York: Springer, 1999: 160-171
  • 4Popovic M, Kovacevic V, Velikic I. A formal software verification concept based on automated theoremproving and reverse engineering [C] //Proc of the 9th Annual IEEE Int Conf on the Engineering of Computer-Based Systems. Los Alamitos, CA: IEEE Computer Sociaty, 2002:59-66
  • 5Hustadt U, Motik B, Sattler U. Reasoning in description logics with a concrete domain in the framework of resolution [C] //Proc of the 16th European Conf on Artificial Intelligence (ECAI 2004). Amsterdam: IOS Press, 2004: 353-357
  • 6Aitken J S, Reichgelt H, Shadbolt N. Resolution theorem proving in reified modal logics [J]. Journal of Automated Reasoning, 1994, 12(1): 103-129
  • 7Moser M, Ibens O, Ietz R, et al. SETHEO and ESETHEO-the CADE-13 systems [J]. Journal of Automated Reasoning, 1997, 18(2): 237-246
  • 8Fitting M. Types and Tableau [M]. Berlin: Springer, 2000
  • 9Dag P, et al. Natural Deduction [M]. New York: Dover Publications, 2006
  • 10Lin H, Sun J G, Zhang Y M. Theorem proving based on extension rule [J]. Journal of Automated Reasoning, 2003, 31(1): 11-21

共引文献138

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部