Skip to main content
Springer Nature Link
Log in

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

  • Conference paper
Frontiers in Algorithmics (FAW 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5598))

Included in the following conference series:

  • 1015 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Hoare, T.: The Verifying Compiler: A Grand Challenge for Computing Research. J. of the ACM 50(1), 63–69 (2003)

    Article  MATH  Google Scholar 

  2. Hoare, T., Misra, J., Shankar, N.: The IFIP Working Conference on Verified Software: Theories, Tools (2005)

    Google Scholar 

  3. The IFIP Working Conference on Verified Software: Theories, Tools, Experiments. Zurich (2005)

    Google Scholar 

  4. 1st Asian Working Conference on Verified Software, Macao (2006)

    Google Scholar 

  5. High Confidence Software and System Coordinating Group. High Confidence Software and Systems Research Needs, USA (2001)

    Google Scholar 

  6. High confidence Medical Device Software and Systems (HCMDSS) Workshop, Philadelphia, June 2-3 (2005)

    Google Scholar 

  7. Xue, J.: A Unified Approach for Developing Efficient Algorithmic Programs. Journal of Science and Technology 12, 103–118 (1997)

    MathSciNet  Google Scholar 

  8. Xue J.: A Practicable Approach for Formal Development of Algorithmic Programs. In: Proceedings of ISFST 1999. Published in Software Association in Japan, 158–160 (1999)

    Google Scholar 

  9. Xue, J.: Two New Strategies for Developing Loop Invariants and its Applications. Journal of Computer Science and Technology 8, 95–102 (1993)

    Google Scholar 

  10. Kleene, S.: Representation of events in nerve nets and finite automata. In: Shannon, McCarthy (eds.) Automata Studies, pp. 3–40. Princeton Univ. Press, Princeton (1956)

    Google Scholar 

  11. aho, A.V., Hopcroft, J.E. (eds.): The Design and Analysis of Computer Algorithms. Addison-Wesley Longman Publishing Co, Inc., Boston (1974)

    MATH  Google Scholar 

  12. Tarjan, R.E.: A unified approach to path problems. Journal of the Association for Computing Machinery 28, 577–593 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  13. Backhouse, R.C., Eijnde, van Gasteren, A.J.M.: Calculating path algorithms. Science of Computer Programming 22, 3–19 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  14. Boulmakoul, A.: Generalized path-finding algorithms on semirings and the fuzzy shortest path problem. J. of Computational and Applied Mathematics 162(1), 263–272 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  15. Corman, T.H., Lieserson, C.E., Rivest, R.L.: Introduction to Algorithms. Prentice Hall India (1990)

    Google Scholar 

  16. Baase, S., Van Gelder, A.: Computer Algorithms: Introduction to Design and Analysis, 3rd edn. Addison-Wesley, Reading (1999)

    Google Scholar 

  17. Hoare, C.A.R.: An Axiomatic Basis for Computer Programming. Commun. ACM 12(10), 576–580 (1969)

    Article  MATH  Google Scholar 

  18. Dijkstra, E.W.: A discipline of programming. Prentice Hall, Englewood Cliffs (1976)

    MATH  Google Scholar 

  19. Jones, C.B.: Systematic software development using VDM. Prentice Hall International Ltd., Hertfordshire (1986)

    MATH  Google Scholar 

  20. Davies, J., Woodcock, J.: Using Z: Specification, Refinement and Proof. Prentice Hall International Series in Computer Science. ISBN 0-13-948472-8 (1996)

    Google Scholar 

  21. Schneider, S., Palgrave: The B-Method: An Introduction. Cornerstones of Computing series (2001)

    Google Scholar 

  22. Smith, D.R.: Designware: software development by refinement. In: Proc. of the 8th Int’l Conference on Category Theory and Computer Science (CTCS 1998), Edinburgh, pp. 3–21 (1999)

    Google Scholar 

  23. Jinyun, X.: Developing the Generic Path Algorithmic Program and Its instantiations Using PAR Method. In: Proceedings of The Second Asian Workshop on Programming Languages, KAIST, Korea (2001)

    Google Scholar 

  24. yun, X.J., Davis, R.: A Derivation and Proof of Knuth’ Binary to Decimal Program. Software—Concepts and Tools, 149–156 (1997)

    Google Scholar 

  25. yun, X.J.: Formal Development of Graph Algorithmic Programs Using Partition-and-Recur. Journal of Computer Sciences and Technology 13(6), 143–151 (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Key Laboratory for High-Performance Computing Technology, Jiangxi Normal University, Nanchang, 330022, China

    Changjing Wang & Jinyun Xue

  2. Institute of Software, Chinese Academy of Sciences, Beijing, 100190, China

    Changjing Wang & Jinyun Xue

  3. Graduate University of Chinese Academy of Sciences, Beijing, 100190, China

    Changjing Wang

Authors
  1. Changjing Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jinyun Xue
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science,, City University of Hong Kong, No. 83 Tat Chee Avenue, Kowloon Tong, Hong Kong, China

    Xiaotie Deng

  2. Computer Science Department, Cornell University, 5144 Upson Hall, NY 14853, Ithaca, USA

    John E. Hopcroft

  3. Provincial Key Laboratory of High-Performance Computing, Jiangxi Normal University, 330027, Nanchang, China

    Jinyun Xue

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, C., Xue, J. (2009). Formal Derivation of a High-Trustworthy Generic Algorithmic Program for Solving a Class of Path Problems. In: Deng, X., Hopcroft, J.E., Xue, J. (eds) Frontiers in Algorithmics. FAW 2009. Lecture Notes in Computer Science, vol 5598. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02270-8_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02270-8_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02269-2

  • Online ISBN: 978-3-642-02270-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics