作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2007, Vol. 33 ›› Issue (09): 49-51.

• 博士论文 • 上一篇    下一篇

形式化方法B的精化

高洪江1,2,覃 征1,3,鹿 蕾4,邵利平1   

  1. (1. 西安交通大学电子与信息工程学院,西安710049;2. 鲁东大学计算机科学与技术学院,烟台264025;
    3. 清华大学软件学院,北京100084;4. 鲁东大学图书馆,烟台264025)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-05-05 发布日期:2007-05-05

Refinement in Formal Method B

GAO Hongjiang1,2, QIN Zheng1,3, LU Lei4, SHAO Liping1   

  1. (1. School of Electronics and Information Engineering, Xi’an Jiaotong University, Xi’an 710049; 2. School of Computer Science and Technology, Ludong University, Yantai 264025; 3. School of Software, Tsinghua University, Beijing 100084; 4. Library, Ludong University, Yantai 264025)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-05-05 Published:2007-05-05

摘要: 形式化方法B支持从抽象规约到实现的完整的开发过程,用于开发安全关键的软件系统。给出了B方法精化的定义后,介绍了抽象机的精化过程与方法,结合实例分析了仅使用前向精化的普通精化规则的不完整性,通过引入反向精化提供了完备的精化理论,二者联合起来能够证明任何正确的精化。

关键词: 形式化方法, 广义代换, 抽象机, 前向精化, 反向精化, 证明义务

Abstract: Formal method B supports the whole development from abstract specifications to implementation, which is used to develop safety-critical systems in software. This paper presents the definition of refinement in B and describes the refinement process of abstract machine and its approaches. After illuminating via an example that B’s ordinary refinement rules only in terms of forward refinement are incomplete, backward refinement is introduced to endow B for the first time with two tractable and jointly complete refinement theories which together are sufficient for proving any valid refinement.


Key words: Formal method, Generalized substitution, Abstract machine, Forward refinement, Backward refinement, Proof obligations