Author Login Editor-in-Chief Peer Review Editor Work Office Work

Computer Engineering ›› 2008, Vol. 34 ›› Issue (22): 25-28. doi: 10.3969/j.issn.1000-3428.2008.22.009

• Degree Paper • Previous Articles     Next Articles

Requirements Verification Method Based on Directed Spanning Graph

RONG Hui-gui1,2, ZHOU Ning1, LU Shao-fei2, XIAO Shuang1   

  1. (1. Information Management School, Wuhan University, Wuhan 430072; 2. Software School, Hunan University, Changsha 410082)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-11-20 Published:2008-11-20

基于有向生成图的需求验证方法

荣辉桂1,2,周 宁1,陆绍飞2,肖 爽1   

  1. (1. 武汉大学信息管理学院,武汉 430072;2. 湖南大学软件学院,长沙 410082)

Abstract: Requirements are abstract and complex during software engineering. Requirements without verification will bring larger risk for the success of project. A method of requirements verification based on directed spanning graph is proposed, and UML dialog map and the mapping strategies of dialog map model are discussed. The process of task division and formal description are analyzed. Some other translation model and algorithms of the verification process are obtained. The validity is tested by the method analyses and a real application.

Key words: requirements verification, directed spanning graph, dialog map model

摘要: 软件工程中的需求具有抽象性和复杂性,未经验证的需求会给项目带来较大需求风险。该文提出一种基于有向生成图的需求验证方法,论述UML对话图建模和模型映射规则、任务分解策略和形式化描述,以及需求验证过程涉及的转化模型和算法。该方法有效克服了需求验证过程中的复杂性和经验操作。从理论上分析该方法的可用性,通过实例验证了该方法的有效性。

关键词: 需求验证, 有向生成图, 对话图模型

CLC Number: