We verified several checkers from the algorithmic library LEDA using the interactive theorem prover Isabelle/HOL as a backend to the automatic code verifier VCC. Currently, using newly developed tools, we show that the verification can be carried out completely within Isabelle/HOL.
In this talk I will give an overview of both approaches and a comparison.