[1]鄢梦恬,石海鹤.基于构件的若干图算法开发和生成[J].江西师范大学学报(自然科学版),2016,40(06):635-639.
 YAN Mengtian,SHI Haihe.Components-Based Graph Algorithms Development and Generation[J].Journal of Jiangxi Normal University:Natural Science Edition,2016,40(06):635-639.
点击复制

基于构件的若干图算法开发和生成()
分享到:

《江西师范大学学报》(自然科学版)[ISSN:1006-6977/CN:61-1281/TN]

卷:
40
期数:
2016年06期
页码:
635-639
栏目:
出版日期:
2016-12-01

文章信息/Info

Title:
Components-Based Graph Algorithms Development and Generation
作者:
鄢梦恬石海鹤
江西师范大学计算机信息工程学院,江西 南昌 330022
Author(s):
YAN MengtianSHI Haihe
College of Computer Information and Engineering,Jiangxi Normal University,Nanchang Jiangxi 330022,China
关键词:
图算法生成 构件 生成式程序设计 PAR方法
Keywords:
graph algorithms generation component generative programming PAR method
分类号:
TP 301
摘要:
软件构件技术可显著提高程序的可靠性和开发效率,极大减少开发成本.泛型程序设计有助于降低编程的复杂度,为重用构件开发提供有效支持.介绍了生成式程序设计思想及泛型程序设计技术,分析了图算法领域的关键特征及领域共性问题,并对广度优先搜索、单源最短路径、所有顶点对最短路径等一类问题进行抽象,设计出相应的泛型图算法构件,进一步借助PAR方法中的泛型机制进行描述,并在PAR平台程序生成系统上进行构件组装生成具体的算法程序.
Abstract:
Software component technology not only significantly improves the reliability and development efficiency of programs,but also reduces the development cost.Generic programming contributes to reducing the complexity of programming,and supports the development of reusable components.Generative programming and generic programming are introduced here,and some characteristics and common features of graph algorithms are analyzed,based on which generic graph algorithm components are abstracted from a class of problems,such as the breadth-first search problem,single source shortest path problem and all vertex-pairs shortest path problem.Further,it is described by means of generic mechanisms of PAR,and several graph algorithm programs are generated via component assembly supported by PAR platform.

参考文献/References:

[1] McIlroy.M D Mass Produced Software Components [EB/OL].
[2015-11-17].https://www.researchgate.net/publication/200827763_Mass_Produced_Software_Components.
[2] Gray J.What next? A dozen information-technology research goals [J].Journal of the ACM,2003,50(1):41-57.
[3] Batory D.Thoughts on automated software design and synthesis [C].New York:ACM Press,2010:29-32.
[4] Xue Jinyun.A unified approach for developing efficient algorithm of programs [J].Journal of Computer Science and Technology,1997,12(4):314-329.
[5] Xue Jinyun.PAR method and its supporting platform [EB/OL].
[2015-11-17].https://www.researchgate.net/publication/285841454_PAR_method_and_its_supporting_platform.
[6] 谢武平,薛锦云.Radl算法到Apla程序的生成系统 [J].计算机研究与发展,2014,51(4):856-864.
[7] 左正康,薛锦云.Apla中泛型约束机制研究 [J].软件学报,2015,26(6):1340-1355.
[8] Czarnecki K,Eisenecker U.Generative programming:methods,tools,and applications [M].New Jersey:Addison-Wesley,2000
[9] Leavens G T,Abrial J R,Batory D,et al.Roadmap for enhanced languages and methods to aid verification [C].New York:ACM Press,2006:221-236.
[10] 范少锋,张乃孝.生成式程序设计研究概述 [J].计算机科学,2005,32(3):12-16.
[11] Batory D,Hofner P,Kim J.Feature interactions,products,and composition [C].New York:ACM Press,2011.
[12] Li Yulin,Novak G.Generation of geometric programs specified by diagrams [C].New York:ACM Press,2011.
[13] Fu J C,Bastani F B,Yen I.Iterative planning in the context of automated code synthesis [C].California:IEEEComputer Society Press,2007.
[14] Xue Jinyun.Formal derivation of graph algorithmic programs using partition-and-recur [J].Journal of Computer Science and Technology,1998,13(6):553-561
[15] Xue Jinyun.Developing the generic path algorithmic program and its instantiations using PAR method [EB/OL].
[2015-11-17].https://www.researchgate.net/publication/221323186_Developing_the_Generic_Path_Algorithmic_Program_and_its_Instantiations_Using_PAR_Method.

相似文献/References:

[1]轩 瑞,陈 磊,石海鹤*.图类算法可重用设计及其实现[J].江西师范大学学报(自然科学版),2023,(01):52.
 XUAN Rui,CHEN Lei,SHI Haihe*.The Reusable Design and Implementation of Graph Algorithms Family[J].Journal of Jiangxi Normal University:Natural Science Edition,2023,(06):52.

备注/Memo

备注/Memo:
收稿日期:2015-12-17基金项目:国家自然科学基金(61363013,61662035)和江西省自然科学基金(20142BAB217026,20151BAB207015)资助项目.通信作者:石海鹤(1979-),女,江西乐平人,教授,博士,主要从事可信软件和基于组件的软件工程研究.
更新日期/Last Update: 1900-01-01