| 逐步求精的一种模型 |
| |
| 引用本文： | 钟珞,管昌生,赵愚,潘昊. 逐步求精的一种模型[J]. 武汉理工大学学报, 1995, 0(3) |
| |
| 作者姓名： | 钟珞 管昌生 赵愚 潘昊 |
| |
| 作者单位： | 武汉工业大学电气自动化系 |
| |
| 摘 要： | 提出一种支持程序开发的结构化方法．该方法以一种简单的问题分解策略为基础，比Ｗｉｒｔｈ－Ｄｉｊｋｓｔｒａ的自顶向下逐步求精方法更利于面向目标的程序设计．由该方法可知，一个程序可经一系列求精而开发出来，每一步求精都能为相应的最弱前置条件序列建立后置条件．这种策略使情况分析减少到极限，简化了结构化程序的证明，并保证了程序结构和数据结构之间的对应．
|
| 关 键 词： | 形式化说明；面向目标；不变式；后置条件；程序推导；自顶向下逐步求精；最弱前置条件 |
A Model of Stepwise Refinement |
| |
| Zhong Luo,Guan Changsheng,Zhao Yu,Pan Hao. A Model of Stepwise Refinement[J]. Journal of Wuhan University of Technology, 1995, 0(3) |
| |
| Authors: | Zhong Luo Guan Changsheng Zhao Yu Pan Hao |
| |
| Abstract: | This paper presentes a constructive method of program development. It is based on a simple strategy for problem decomposition that is claimed to be more supportive of goal-oriented programming than the Wirth-Dijkstra top-down refinement method. With the method,a program is developed by makeing a sequeue of refinements,each of which can establish the postcondition for a corresponding sequence of weaker preconditions. The strategy can minimize case analysis,simplefy constructive program proof,and ensure a correspondence between program structure and data structure. |
| |
| Keywords: | formal specification goal-oriented programming invarants postconditions program derivation top-town refinement weakest preconditions |
| 本文献已被 CNKI 等数据库收录！ |
