Formally-Proven Kosaraju's algorithm

Laurent Théry 1, *
* Corresponding author
1 MARELLE - Mathematical, Reasoning and Software
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : This notes explains how the Kosaraju's algorithm that computes the strong-connected components of a directed graph has been for-malised in the Coq prover using the SSReflect extension.
Document type :
Preprints, Working Papers, ...
Liste complète des métadonnées

Cited literature [2 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01095533
Contributor : Laurent Thery <>
Submitted on : Thursday, February 26, 2015 - 1:01:07 PM
Last modification on : Thursday, January 11, 2018 - 4:48:46 PM
Document(s) archivé(s) le : Wednesday, May 27, 2015 - 11:56:05 AM

File

Note.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01095533, version 2

Collections

Citation

Laurent Théry. Formally-Proven Kosaraju's algorithm. 2015. ⟨hal-01095533v2⟩

Share

Metrics

Record views

213

Files downloads

207