Formally-Proven Kosaraju's algorithm - Archive ouverte HAL
Preprints, Working Papers, ... Year : 2015

Formally-Proven Kosaraju's algorithm

Laurent Théry
Connectez-vous pour contacter l'auteur
Mathematical, Reasoning and Software

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.

Domains

Logic in Computer Science [cs.LO]
Fichier principal
Vignette du fichier
Note.pdf (205.55 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Laurent Théry  : Connect in order to contact the contributor

https://hal.science/hal-01095533

Submitted on : Thursday, February 26, 2015-1:01:07 PM

Last modification on : Wednesday, March 15, 2023-8:58:09 AM

Long-term archiving on : Wednesday, May 27, 2015-11:56:05 AM

Download

Dates and versions

hal-01095533 , version 1 (15-12-2014)
hal-01095533 , version 2 (26-02-2015)

Identifiers

  • HAL Id : hal-01095533 , version 2

Cite

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

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

INRIA INRIA2 UNIV-COTEDAZUR
318 View
539 Download

Share

More