Depth-First Search and Strong Connectivity in Coq - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Depth-First Search and Strong Connectivity in Coq

Abstract

Using Coq, we mechanize Wegener's proof of Kosaraju's linear-time algorithm for computing the strongly connected components of a directed graph. Furthermore, also in Coq, we define an executable and terminating depth-first search algorithm.
Fichier principal
Vignette du fichier
jfla15_submission_2.pdf (641.62 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01096354 , version 1 (17-12-2014)

Identifiers

  • HAL Id : hal-01096354 , version 1

Cite

François Pottier. Depth-First Search and Strong Connectivity in Coq. Vingt-sixièmes journées francophones des langages applicatifs (JFLA 2015), Jan 2015, Le Val d'Ajol, France. ⟨hal-01096354⟩
276 View
182 Download

Share

Gmail Facebook Twitter LinkedIn More