Formal Proofs of Tarjan's Strongly Connected Components Algorithm in Why3, Coq and Isabelle

Comparing provers on a formalization of the same problem is always a valuable exercise. In thispaper, we present the formal proof of correctness of a non-trivial algorithm from graph theory thatwas carried out in three proof assistants: Why3,Coq, and Isabelle.

Mots clés

Mathematical logic Program verification Graph algorithm Formal proof

Domaines

Logique en informatique [cs.LO]

Fichier principal

LIPIcs-ITP-2019-13.pdf (567.34 Ko)

Origine	Fichiers produits par l'(les) auteur(s)

Stephan Merz : Connectez-vous pour contacter le contributeur

https://inria.hal.science/hal-02303987

Soumis le : mercredi 2 octobre 2019-17:34:33

Dernière modification le : vendredi 6 décembre 2024-03:19:53

Dates et versions

hal-02303987 , version 1 (02-10-2019)

Identifiants

HAL Id : hal-02303987 , version 1
DOI : 10.4230/LIPIcs.ITP.2019.13

Citer

Ran Chen, Cyril Cohen, Jean-Jacques Levy, Stephan Merz, Laurent Théry. Formal Proofs of Tarjan's Strongly Connected Components Algorithm in Why3, Coq and Isabelle. ITP 2019 - 10th International Conference on Interactive Theorem Proving, Sep 2019, Portland, United States. pp.13:1 - 13:19, ⟨10.4230/LIPIcs.ITP.2019.13⟩. ⟨hal-02303987⟩

Exporter

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UNIV-PARIS7 CNRS INRIA UNIV-LORRAINE INRIA2 LORIA LORIA-FM USPC UNIV-COTEDAZUR IMPACT-DIGITRUST UP-SCIENCES IRIF

319 Consultations

659 Téléchargements