MFCS 2019: Kurt Mehlhorn: Trustworthy Graph Algorithms

Monday, August 26, 2019

Speaker: Kurt Mehlhorn (Max-Planck-Institut für Informatik, Saarbrücken)

 

Abstract: 

The goal of the LEDA project was to build an easy-to-use and extendable library of correct and efficient data structures, graph algorithms and geometric algorithms. We report on the use of formal program verification to achieve an even higher level of trustworthiness. Specifically, we report on an ongoing and largely finished verification of the blossom-shrinking algorithm for maximum cardinality matching.