Formalization of graph search algorithms and its applications

  • Mitsuharu Yamamoto
  • Koichi Takahashi
  • Masami Hagiya
  • Shin-ya Nishizaki
  • Tetsuo Tamai
Refereed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1479)


This paper describes a formalization of a class of fixed-point problems on graphs and its applications. This class captures several well-known graph theoretical problems such as those of shortest path type and for data flow analysis. An abstract solution algorithm of the fixed-point problem is formalized and its correctness is proved using a theorem proving system. Moreover, the validity of the A* algorithm, considered as a specialized version of the abstract algorithm, is proved by extending the proof of the latter. The insights we obtained through these formalizations are described. We also discuss the extension of this approach to the verification of model checking algorithms.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    David Basin and Matt Kaufmann. The Boyer-Moore prover and Nuprl: An experimental comparison. In Gérard Huet and Gordon Plotkin, editors, Logical Frameworks, pages 89–119. Cambridge University Press, 1991.Google Scholar
  2. 2.
    Robert S. Boyer and J Strother Moore. A Computational Logic. Academic Press, New York, 1979.Google Scholar
  3. 3.
    Albert J. Camilleri and Wishnu Prasetya. Cpo theory, 1994. Available from Scholar
  4. 4.
    C.-T. Chou. A formal theory of undirected graphs in higher-order logic. In Proceedings of the 7th International Workshop on Higher Order Logic Theorem Proving and Its Applications, volume 859 of LNCS, pages 144–157, Valletta, Malta, September 1994. Springer-Verlag.Google Scholar
  5. 5.
    Ching-Tsun Chou and Doron Peled. Verifying a model-checking algorithm. In Tools and Algorithms for the Construction and Analysis of Systems, number 1055 in LNCS, pages 241–257, Passau, Germany, 1996. Springer-Verlag.Google Scholar
  6. 6.
    A. Church. A formulation of the simple theory of types. Journal of Symbolic Logic, 5:56–68, 1940.zbMATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    E. Allen Emerson. Handbook of Theoretical Computer Science, chapter 16. Elsevier Science Publishers B.V., 1990.Google Scholar
  8. 8.
    M. J. C. Gordon and T. F. Melham, editors. Introduction to HOL: A theorem proving environment for higher order logic. Cambridge University Press, 1993.Google Scholar
  9. 9.
    R. HÄhnle, M. Heisel, W. Reif, and W. Stephan. An interactive verification system based on dynamic logic. In J. Seikmann, editor, 8th International Conference on Automated Deduction, number 230 in LNCS, pages 306–315, Oxford, 1986. Springer-Verlag. Also note etse Scholar
  10. 10.
    Wim H. Hesselink. The verified incremental design of a distributed spanning tree algorithm — extended abstract. Computing Science Reports Groningen CS-R9602, November 1997. Available from Scholar
  11. 11.
    G. Kildall. A unified approach to global program optimization. In POPL, pages 194–206, 1973.Google Scholar
  12. 12.
    Bruno Martin, July 1997. Private Communication.Google Scholar
  13. 13.
    Nils J. Nilsson. Principles of Artificial Intelligence. Tioga Publishing, 1980.Google Scholar
  14. 14.
    N. Shankar, S. Owre, and J. Rushby. The PVS proof checker: A reference manual. Technical report, Computer Science Lab, SRI Intl., 1993.Google Scholar
  15. 15.
    Tetsuo Tamai. A class of fixed-point problems on graphs and iterative solution algorithms. In Logic and Software Engineering, pages 102–121. World Scientific, 1996.Google Scholar
  16. 16.
    P. Windley. Abstract theories in HOL. In Higher Order Logic Theorem Proving and its Applications: Proceedings of the IFIP TC10/WG10.2 Workshop, volume A-20 of IFIP Transactions, pages 197–210, Leuven, Belgium, September 1992. North-Holland/Elsevier.Google Scholar
  17. 17.
    W. Wong. A simple graph theory and its application in railway signalling. In Proceedings of the 1991 International Workshop on the HOL Theorem Proving System and its Applications, pages 395–409, Davis, California, USA, August 1991. IEEE Computer Society Press, 1992.Google Scholar
  18. 18.
    Mitsuharu Yamamoto, Shin-ya Nishizaki, Masami Hagiya, and Yozo Toda. Formalization of planar graphs. In 8th International Workshop on Higher-Order Logic Theorem Proving and Its Applications, volume 971 of LNCS, pages 369–384. Springer-Verlag, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Mitsuharu Yamamoto
    • 1
  • Koichi Takahashi
    • 2
  • Masami Hagiya
    • 3
  • Shin-ya Nishizaki
    • 4
  • Tetsuo Tamai
    • 5
  1. 1.Faculty of ScienceChiba UniversityChibaJapan
  2. 2.Electrotechnical LaboratoryIbarakiJapan
  3. 3.Graduate School of ScienceThe University of TokyoTokyoJapan
  4. 4.Graduate School of Information Science and EngineeringTokyo Institute of TechnologyTokyoJapan
  5. 5.Graduate School of Arts and SciencesThe University of TokyoTokyoJapan

Personalised recommendations