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

Ran Chen 1 Cyril Cohen 2 Jean-Jacques Levy 3 Stephan Merz 4 Laurent Thery 2
2 MARELLE - Mathematical, Reasoning and Software
CRISAM - Inria Sophia Antipolis - Méditerranée
3 PI.R2 - Design, study and implementation of languages for proofs and programs
PPS - Preuves, Programmes et Systèmes, UPD7 - Université Paris Diderot - Paris 7, CNRS - Centre National de la Recherche Scientifique, Inria de Paris
4 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
LORIA - FM - Department of Formal Methods , Inria Nancy - Grand Est, MPII - Max-Planck-Institut für Informatik
Abstract : Comparing provers on a formalization of the same problem is always a valuable exercise. In this paper, we present the formal proof of correctness of a non-trivial algorithm from graph theory that was carried out in three proof assistants: Why3, Coq, and Isabelle.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

https://hal.inria.fr/hal-01906155
Contributor : Stephan Merz <>
Submitted on : Friday, October 26, 2018 - 2:43:12 PM
Last modification on : Friday, April 19, 2019 - 4:54:53 PM
Long-term archiving on : Sunday, January 27, 2019 - 2:44:09 PM

Files

paper.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01906155, version 1
  • ARXIV : 1810.11979

Citation

Ran Chen, Cyril Cohen, Jean-Jacques Levy, Stephan Merz, Laurent Thery. Formal Proofs of Tarjan's Algorithm in Why3, Coq, and Isabelle. 2018. ⟨hal-01906155⟩

Share

Metrics

Record views

107

Files downloads

96