Abstract
In contrast to other areas of mathematics such as calculus, number theory or probability theory, there is currently no standard library for graph theory for the Isabelle/HOL proof assistant. We present a formalization of directed graphs and essential related concepts. The library supports general infinite directed graphs (digraphs) with labeled and parallel arcs, but care has been taken not to complicate reasoning on more restricted classes of digraphs. We use this library to formalize a characterization of Euler Digraphs and to verify a method of checking Kuratowski subgraphs used in the LEDA library.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alkassar, E., Böhme, S., Mehlhorn, K., Rizkallah, C.: A framework for the verification of certifying computations. JAR (2013). doi:10.1007/s10817-013-9289-2
Ballarin, C.: Locales: A module system for mathematical theories. JAR (2013). doi:10.1007/s10817-013-9284-7
Bang-Jensen J., Gutin G.Z.: Digraphs: Theory, Algorithms and Applications. 2nd edn. Springer, New York (2009)
Butler, R.W., Sjogren, J.A.: A PVS graph theory library. Tech. Rep., NASA Langley (1998)
Chou, C.: A formal theory of undirected graphs in higher-order logic. In: Proceedings of TPHOLs ’94. pp. 144–157. Springer, New York (1994)
Diestel R.: Graph Theory, GTM, vol. 173. 4 edn. Springer, New York (2010)
Duprat, J.: A Coq toolkit for graph theory. Rapport de recherche 2001-15. LIP ENS, Lyon (2001)
Esparza, J., Lammich, P., Neumann, R., Nipkow, T., Schimpf, A., Smaus, J.G.: A fully verified executable LTL model checker. In: Proceedings of CAV 2013, pp. 463–478 (2013)
Gonthier, G.: computer-checked proof of the Four Colour Theorem (2005)
Harary, F., Read, R.: Is the null-graph a pointless concept? In: Graphs and Combinatorics, pp. 37–44. Springer, New York (1974)
Hunt, Warren A., J., Kaufmann, M., Krug, R.B., Moore, J.S., Smith, E.W.: Meta reasoning in ACL2. In: Proceedings of TPHOLs ’05, pp. 163–178. Springer, New York (2005)
Kuratowski C.: Sur le problème des courbes gauches en topologie. Fundam. Math. 15(1), 271–283 (1930)
Mehlhorn K., Näher S.: LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (2000)
Nakamura Y., Rudnicki P.: Euler circuits and paths. Formaliz. Math. 6(3), 417–425 (1997)
Nipkow, T., Bauer, G., Schultz, P.: Flyspeck I: Tame graphs. In: Proc. IJCAR ’06. pp. 21–35. Springer, New York (2006)
Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL: A Proof Assistant for Higher-Order Logic. Springer, New York (2002)
Nordhoff, B., Lammich, P.: Dijkstra’s shortest path algorithm. Arch. Formal Proofs (2012). http://afp.sf.net/entries/Dijkstra_Shortest_Path
Noschinski, L.: Graph theory. Arch. Formal Proofs (2013). http://afp.sf.net/devel-entries/Graph_Theory.shtml, Formal proof development
Noschinski, L., Rizkallah, C., Mehlhorn, K.: Verification of certifying computations through AutoCorres and Simpl. In: Proceedings of NFM ’14. doi:10.1007/978-3-319-06200-6_4
Rizkallah, C.: An axiomatic characterization of the single-source shortest path problem. Arch. Formal Proofs (2013). http://afp.sf.net/entries/ShortestPath.shtml, Formal proof development
Traytel, D., Berghofer, S., Nipkow, T.: Extending Hindley-Milner type inference with coercive structural subtyping. In: APLAS ’11. pp. 89–104. Springer, New York (2011)
Volkmann L.: Fundamente der Graphentheorie. Springer, New York (1996)
Wong, W.: A simple graph theory and its application in railway signaling. In: Proceedings TPHOLs ’91. pp. 395–409. IEEE (1991)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Noschinski, L. A Graph Library for Isabelle. Math.Comput.Sci. 9, 23–39 (2015). https://doi.org/10.1007/s11786-014-0183-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11786-014-0183-z