A formal theory of undirected graphs in higher-order logc-Reference-Cited by-同舟云学术

A formal theory of undirected graphs in higher-order logc

Published:1994 Issue: Volume: Page:144-157
ISSN:0302-9743
Container-title:Higher Order Logic Theorem Proving and Its Applications
language:
Short-container-title:

Author:

Chou Ching-Tsun

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-58450-1_40.pdf

Reference9 articles.

1. N.G. de Bruijn, “Checking Mathematics with Computer Assistance”, in Notices of the American Mathematical Society, Vol. 38, No. 1, pp. 8–15, Jan. 1991.

2. Ching-Tsun Chou, “Mechanical Verification of Distributed Algorithms in Higher-Order Logic”, in this Proceedings.

3. Shimon Even, Graph Algorithms, Computer Science Press, 1979.

4. R.G. Gallager, P.A. Humblet, and P.M. Spira, “A Distributed Algorithm for Minimum-Weight Spanning Trees”, in ACM Trans. on Programming Languages and Systems, Vol. 5, No. 1, pp. 66–77, Jan. 1983.

5. Michael J.C. Gordon, “HOL: A Proof Generating System for Higher-Order Logic”, pp. 73–128 of G. Birtwistle and P.A. Subrahmanyam (ed.), VLSI Specification, Verification and Synthesis, Kluwer Academic Publishers, 1988.

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Functional Correctness of C Implementations of Dijkstra’s, Kruskal’s, and Prim’s Algorithms;Computer Aided Verification;2021

2. Graph Theory in Coq: Minors, Treewidth, and Isomorphisms;Journal of Automated Reasoning;2020-01-31

3. A constructive formalization of the weak perfect graph theorem;Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs;2020-01-20

4. A Formal Proof of the Minor-Exclusion Property for Treewidth-Two Graphs;Interactive Theorem Proving;2018

5. A Graph Library for Isabelle;Mathematics in Computer Science;2014-06-28