检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机科学》2005年第3期12-16,25,共6页Computer Science
基 金:国家自然科学基金(编号60273001)
摘 要:随着软件规模越来越大、软件复杂度越来越高,如何高效地开发出高质量的软件以及如何有效地维护和更新软件都是当前软件方法学研究所关注的重点。为了实现这一目标,已经陆续出现一些有效的方法和技术。KrzysztofCzarnecki和U.Eisenecker融合先进方法和技术的精髓,提出了一种新的软件工程范型——生成式程序设计:基于为软件系统族进行建模,对给定的需求规格说明,利用配置知识,把基本的可重用构件根据需求进行自动化的配置以产生离定制、优化的软件产品。生成式程序设计的基础是面向系统族的生成式领域模型,该模型包括三个基本成分:问题域、解域和连接这两个域的配置知识。生成式程序设计包含两个开发周期:一个是设计和实现生成式领域模型,即支持重用的开发;另一个是利用生成式领域模型生产出具体的软件系统,也即利用重用的开发。本文将详细地介绍此软件工程范型的分析与设计方法和实现技术。Not only the size of software is becoming larger and larger,but also its complexity is becoming higher and higher. How to efficiently develop software products with high quality and how to effectively maintain software and e- volve it become the focus of software methodology. To realize these goals,some effective methods and technologies have been proposed in sucess. Combining the soul of some advanced methods and technologies, Krzysztof Czarnecki and U. Eisenecker proposed a new software engineering paradigm,generative programming. GP is based on modeling software system families such that,given a particular requirement specification,a highly customized and optimized in- termediate or end-product can be automatically manufactured on demand from elementary reusable implementation components by means of configuration knowledge. GP encompasses two complete development cycles: one for design- ing and implementing the generative domain model,that is to develop for reuse; the other for using the generative do- main model to produce concrete system,that is to develop with reuse. This paper will discuss the analysis and design method,as well as the related implementing technologies of the new proposed software engineering paradigm.
关 键 词:生成式程序设计 软件规模 软件复杂度 建模 配置知识
分 类 号:TP311.5[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30