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

Requirements Verification Method Based on Directed Spanning Graph

作　　者：荣辉桂[1,2] 周宁[1] 陆绍飞[2] 肖爽[1] 

机构地区：[1]武汉大学信息管理学院,武汉430072 [2]湖南大学软件学院,长沙410082

出　　处：《计算机工程》2008年第22期25-28,31,共5页Computer Engineering

基　　金：国家自然科学基金资助项目(60673093);教育部重大攻关基金资助项目(05JZD00024)

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

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

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]