中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Title:
research on automated sorting algorithms generation based on par
Author: Shi Hai-He ; Xue Jin-Yun
Keyword: Automation ; Formal methods ; Sorting
Source: Ruan Jian Xue Bao/Journal of Software
Issued Date: 2012
Volume: 23, Issue:9, Pages:2248-2260
Indexed Type: EI
Department: (1) Provincial Key Laboratory of High Performance Computing (Jiangxi Normal University) Nanchang 330022 China; (2) National Key Laboratory of Computer Science Institute of Software The Chinese Academy of Sciences Beijing 100190 China; (3) Graduate University The Chinese Academy of Sciences Beijing 100049 China
Abstract: Sorting is a kind of special problem in computer science. The flexibility of whose algorithm design tactics leads to the diversity of sorting algorithms. Based on the formal method PAR (partition-and-recur), an automated sorting algorithm generation is studied. The algebraic property of sorting problem is described, generic type components and algorithm components are formally developed, and domain specific language and a formal algorithm generative model are designed. Through replacing the generic identifiers with a few concrete operations a series of known and unknown sorting algorithms, such as quick sort, heap sort, shell sort, and increment select sort, etc., are automatically generated, which is supported by the enhanced program generation system. Through the super framework and underlying components, the reliability and productivity of domain specific algorithm have dramatically improved. © 2012 ISCAS.
English Abstract: Sorting is a kind of special problem in computer science. The flexibility of whose algorithm design tactics leads to the diversity of sorting algorithms. Based on the formal method PAR (partition-and-recur), an automated sorting algorithm generation is studied. The algebraic property of sorting problem is described, generic type components and algorithm components are formally developed, and domain specific language and a formal algorithm generative model are designed. Through replacing the generic identifiers with a few concrete operations a series of known and unknown sorting algorithms, such as quick sort, heap sort, shell sort, and increment select sort, etc., are automatically generated, which is supported by the enhanced program generation system. Through the super framework and underlying components, the reliability and productivity of domain specific algorithm have dramatically improved. © 2012 ISCAS.
Language: 中文
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/15139
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Shi Hai-He,Xue Jin-Yun. research on automated sorting algorithms generation based on par[J]. Ruan Jian Xue Bao/Journal of Software,2012-01-01,23(9):2248-2260.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Shi Hai-He]'s Articles
[Xue Jin-Yun]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Shi Hai-He]‘s Articles
[Xue Jin-Yun]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace