Completeness of an Axiomatization of Graph Isomorphism via Graph Rewriting in Coq - Archive ouverte HAL Access content directly
Conference Papers Year : 2020

Completeness of an Axiomatization of Graph Isomorphism via Graph Rewriting in Coq

(1, 2, 3, 4, 5) , (3, 1)
1
2
3
4
5

Abstract

The labeled multigraphs of treewidth at most two can be described using a simple term language over which isomor-phism of the denoted graphs can be finitely axiomatized. We formally verify soundness and completeness of such an axiomatization using Coq and the mathematical components library. The completeness proof is based on a normalizing and confluent rewrite system on term-labeled graphs. While for most of the development a dependently typed representation of graphs based on finite types of vertices and edges is most convenient, we switch to a graph representation employing a fixed type of vertices shared among all graphs for establishing confluence of the rewrite system. The completeness result is then obtained by transferring confluence from the fixed-type setting to the dependently typed setting.
Fichier principal
Vignette du fichier
coq-2pdom (1).pdf (693.52 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02333553 , version 1 (25-10-2019)
hal-02333553 , version 2 (26-10-2019)
hal-02333553 , version 3 (08-01-2020)

Identifiers

Cite

Christian Doczkal, Damien Pous. Completeness of an Axiomatization of Graph Isomorphism via Graph Rewriting in Coq. CPP 2020 - 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, Jan 2020, New Orleans, LA, United States. ⟨10.1145/3372885.3373831⟩. ⟨hal-02333553v3⟩
338 View
337 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More