A Semi-automatic Proof of Strong connectivity - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

A Semi-automatic Proof of Strong connectivity


We present a formal proof of the classical Tarjan-1972 algorithm for finding strongly connected components in directed graphs. We use the Why3 system to express these proofs and fully check them by computer. The Why3-logic is a simple multi-sorted first-order logic augmented by inductive predicates. Furthermore it provides useful libraries for lists and sets. The Why3 system allows the description of programs in a Why3-ML programming language (a first-order programming language with ML syntax) and provides interfaces to various state-of-the-art automatic provers and to manual interactive proof-checkers (we use mainly Coq). We do not claim that this proof is new, although we could not find a formal proof of that algorithm in the literature. But one important point of our article is that our proof is here completely presented and human readable.
Fichier principal
Vignette du fichier
17scct.pdf (735.88 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01632947 , version 1 (10-11-2017)


  • HAL Id : hal-01632947 , version 1


Ran Chen, Jean-Jacques Lévy. A Semi-automatic Proof of Strong connectivity. 9th Working Conference on Verified Software: Theories, Tools and Experiments (VSTTE), Jul 2017, Heidelberg, Germany. ⟨hal-01632947⟩
516 View
168 Download


Gmail Facebook X LinkedIn More