Institutional Repository
| research on automated sorting algorithms generation based on par | |
| Shi Hai-He; Xue Jin-Yun | |
| 2012 | |
| Source | Ruan Jian Xue Bao/Journal of Software
 |
| ISSN | 1000-9825 |
| Volume | 23Issue:9Pages:2248-2260 |
| 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.; 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. |
| Indexed Type | EI |
| Keyword | Automation Formal Methods Sorting |
| 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 |
| Language | 中文 |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/15139 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Shi Hai-He,Xue Jin-Yun. research on automated sorting algorithms generation based on par[J]. Ruan Jian Xue Bao/Journal of Software,2012,23(9):2248-2260. |
| APA | Shi Hai-He,&Xue Jin-Yun.(2012).research on automated sorting algorithms generation based on par.Ruan Jian Xue Bao/Journal of Software,23(9),2248-2260. |
| MLA | Shi Hai-He,et al."research on automated sorting algorithms generation based on par".Ruan Jian Xue Bao/Journal of Software 23.9(2012):2248-2260. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment