Automatically verified implementation of data structures based on AVL trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Automatically verified implementation of data structures based on AVL trees

Abstract

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.
Fichier principal
Vignette du fichier
main.pdf (206.25 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01067217 , version 1 (23-09-2014)

Identifiers

  • HAL Id : hal-01067217 , version 1

Cite

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⟩
470 View
368 Download

Share

Gmail Facebook X LinkedIn More