检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]江西科技师范大学数学与计算机科学学院,江西南昌330038 [2]同济大学计算机科学与技术系,上海201804 [3]江西农业大学软件学院,江西南昌330045
出 处:《计算机工程与设计》2015年第9期2406-2411,共6页Computer Engineering and Design
基 金:国家863高技术研究发展计划基金项目(2009AA012201);国家自然科学基金项目(61272107;61202173;61103068;61402244);江西省教育厅科技计划基金项目(GJJ13569);江西科技师范大学科研基金项目(Ky2012zy11)
摘 要:针对现有软件体系结构演化研究很少考虑构件可信属性及其表达的问题,提出类E-R图方法,描述考虑构件可信属性的软件体系结构及其演化过程。给出具有可信属性的软件体系结构(SA-T)概念,引入类E-R图表示SA-T,得到SA-T图,通过关系逻辑形式化描述SA-T图;利用类E-R图描述方法表达构件和连接件的增加、删除、替换演化操作;通过一个电子商务系统软件体系结构演化实例,进一步论述SA-T演化的类E-R图描述方法。该方法对软件可信演化研究具有一定意义。Because the trusted attributes of components and its representation are barely considered in the research of software architecture evolution, the method of analogy entity-relationship diagram which depicted the software architecture with trusted attributes and its evolution process was presented. The concept of software architecture with trusted attributes (SA-T) was proposed. The analogy entity-relationship diagram was introduced to represent SA-T, and the SA-T diagram was obtained. The for- mal description was given for SA-T diagram using relational logic. The operations such as addition, deletion and substitution of component and connector were further described using analogy entity-relationship diagram. Combined with an SA evolution case for e-commerce system, the description method of analogy entity-relationship diagram was further elaborated. The study has certain significance on the research of trusted software evolution.
关 键 词:软件体系结构 软件演化 可信属性 类E-R图 描述方法
分 类 号:TP311[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222