Formal Derivation of a High-Trustworthy Generic Algorithmic Program for Solving a Class of Path Problems

Authors:
Changjing Wang;Jinyun Xue
Affiliations:
Key Laboratory for High-Performance Computing Technology, Jiangxi Normal University, Nanchang 330022 and Institute of Software, Chinese Academy of Sciences, Beijing 100190 and Graduate University ...;Key Laboratory for High-Performance Computing Technology, Jiangxi Normal University, Nanchang 330022 and Institute of Software, Chinese Academy of Sciences, Beijing 100190
Venue:
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Year:
2009

Citing 11
Cited 0

Systematic software development using VDM

Systematic software development using VDM
Introduction to algorithms

Introduction to algorithms
Calculating path algorithms

Science of Computer Programming - Special issue on mathematics of program construction
Using Z: specification, refinement, and proof

Using Z: specification, refinement, and proof
A Unified Approach to Path Problems

Journal of the ACM (JACM)
An axiomatic basis for computer programming

Communications of the ACM
A Discipline of Programming

A Discipline of Programming
Computer Algorithms: Introduction to Design and Analysis

Computer Algorithms: Introduction to Design and Analysis
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
The verifying compiler: A grand challenge for computing research

Journal of the ACM (JACM)
Generalized path-finding algorithms on semirings and the fuzzy shortest path problem

Journal of Computational and Applied Mathematics - Special issue: Proceedings of the international conference on linear algebra and arithmetic, Rabat, Morocco, 28-31 May 2001

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.