Automatically verified implementation of data structures based on AVL trees

Martin Clochard (1, 2)

1 TOCCATA - Formally Verified Programs, Certified Tools and Numerical Computations
2 LRI - Laboratoire de Recherche en Informatique

We propose verified implementations of several data structures, including random-access lists and ordered maps. They are derived from a common parametric implementation of self-balancing binary trees in the style of Adelson-Velskii and Landis trees. The development of the specifications, mplementations and proofs is carried out using the Why3 environment. The originality of this approach is the genericity of the specifications and code combined with a high level of proof automation.

Domaines: Logique en informatique [cs.LO]

Martin Clochard. Automatically verified implementation of data structures based on AVL trees. 6th Working Conference on Verified Software: Theories, Tools and Experiments (VSTTE), Jul 2014, Vienna, Austria. ⟨hal-01067217⟩