formal derivation of a high-trustworthy generic algorithmic program for solving a class of path problems
文献类型:会议论文
作者 | Wang Changjing ; Xue Jinyun |
出版日期 | 2009 |
会议名称 | 3rd International Frontiers of Algorithmics Workshop, FAW 2009 |
会议日期 | 37427 |
会议地点 | Hefei, China |
关键词 | Algorithms Computer software |
英文摘要 | Recently high-trustworthy software has been proposed and advocated by many academic and engineering communities. High-trustworthy algorithm is core to high-trustworthy software. In this paper, using PAR method we derive formally a high-trustworthy generic algorithmic program for solving general single-source path problems. Common characteristics of these path problems can be abstracted into an algebra structure-dioid. Some typical graph algorithms, such as Bellman-Ford single-source shortest path algorithm, Reachability problem algorithm, and Bottleneck problem algorithm, etc. are all instances of the generic algorithmic program. Our approach mainly employs formal derivation technology and generic technology. Main contribution is combining the two techniques into a systemic approach, which aims to develop high-trustworthy generic algorithmic program for solving general problems. According to our approach, the correctness, reliability, safety and development efficiency of algorithmic programs are greatly improved. It is expected to be a promising approach to develop high-trustworthy generic algorithmic program. © 2009 Springer Berlin Heidelberg. |
会议录 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
![]() |
会议录出版地 | Germany |
ISSN号 | 3029743 |
ISBN号 | 3642022693 |
源URL | [http://124.16.136.157/handle/311060/8418] ![]() |
专题 | 软件研究所_计算机科学国家重点实验室 _会议论文 |
推荐引用方式 GB/T 7714 | Wang Changjing,Xue Jinyun. formal derivation of a high-trustworthy generic algorithmic program for solving a class of path problems[C]. 见:3rd International Frontiers of Algorithmics Workshop, FAW 2009. Hefei, China. 37427. |
入库方式: OAI收割
来源:软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。