Institutional Repository
| generating provably correct algorithmic programs from formal specifications | |
| Shi Haihe; Xue Jinyun | |
| 2010 | |
| Conference Name | 10th International Conference on Quality Software, QSIC 2010 |
| Source | Proceedings - International Conference on Quality Software |
| Pages | 270-275 |
| Conference Date | 37451 |
| Conference Place | Zhangjiajie, China |
| Indexed Type | EI |
| Publish Place | United States |
| ISSN | 15506002 |
| ISBN | 9780770000000 |
| Department | (1) Institute of Software, Chinese Academy of Sciences, Beijing, China; (2) Provincial Key Laboratory for High-Performance Computing Technology, Jiangxi Normal University, Nanchang, China; (3) Graduate University, Chinese Academy of Sciences, Beijing, China |
| English Abstract | Software automation has been viewed as a revolutionary way to improve the dependability and productivity of software. The paper takes the sorting algorithms as study cases, employs PAR method and generic techniques, and derives two abstract generic sorting algorithmic programs, from which a class of concrete sorting algorithmic programs can be generated automatically through operation replacement. And further specialized programs can be produced in multiple languages from a single copy of the instantiated algorithmic program automatically by means of the PAR platform. © 2010 IEEE. |
| Keyword | Algorithmic Languages Computer Programming Computer Software Selection And Evaluation |
| Sponsorship | National Laboratory for Parallel and Distributed Processing; The University of Hong Kong |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/8782 |
| Collection | 基础软件与系统重点实验室 |
| Recommended Citation GB/T 7714 | Shi Haihe,Xue Jinyun. generating provably correct algorithmic programs from formal specifications[C]. United States,2010:270-275. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| generating provably （276KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment