Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Readable semi-automatic formal proofs of Depth-First Search in graphs using Why3

Ran Chen 1 Jean-Jacques Levy 2 
2 PI.R2 - Design, study and implementation of languages for proofs and programs
PPS - Preuves, Programmes et Systèmes, Inria Paris-Rocquencourt, UPD7 - Université Paris Diderot - Paris 7, CNRS - Centre National de la Recherche Scientifique : UMR7126
Abstract : Quite often formal proofs are not published in conferences or journal articles, because formal proofs are usually too long. A typical article states the ability of having implemented a formal proof, but the proof itself is often sketched in terms of a natural language. At best, some formal lemmas and definitions are stated. Can we do better ? We try here to publish the details of a formal proof of the white-paths theorem about depth-first search in graphs. We use Why3 as the proving platform, because Why3 uses first-order logic augmented with inductive definitions of predicates and because Why3 makes possible to delegate bits of proofs to on-the-shelf automatic provers at same time as Why3 provides interfaces with interactive proof checkers such that Coq, PVS or Isabelle. Algorithms on graphs are also a good testbed since graphs are combinatorial structures whose algebraic properties are not fully obvious. Depth-first search may look over-simple, but it is the first step of the construction of a library of readable formal proofs for more complex algorithms on graphs with more realistic data structures.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download
Contributor : Jean-Jacques Levy Connect in order to contact the contributor
Submitted on : Friday, January 8, 2016 - 4:45:41 PM
Last modification on : Friday, January 21, 2022 - 3:21:40 AM
Long-term archiving on: : Thursday, November 10, 2016 - 10:37:01 PM


Files produced by the author(s)


  • HAL Id : hal-01253136, version 1



Ran Chen, Jean-Jacques Levy. Readable semi-automatic formal proofs of Depth-First Search in graphs using Why3. 2015. ⟨hal-01253136⟩



Record views


Files downloads