Section: New Results

Formalized graph theory algorithms

Participants : Cyril Cohen, Laurent Théry, Ran Chen [Chinese Academy of Science] , Jean-Jacques Lévy [Inria Pi.r2] , Stephan Merz [Inria Veridis] .

We formalise the correctness proof of Tarjan's algorithm for computing strongly connected components using the Mathematical Component Library. This leads to a comparison of formalisation between various systems described in [22].