Skip to Main content Skip to Navigation
Conference papers

Automatically verified implementation of data structures based on AVL trees

Martin Clochard 1, 2 
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.
Document type :
Conference papers
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download
Contributor : Claude Marché Connect in order to contact the contributor
Submitted on : Tuesday, September 23, 2014 - 11:15:35 AM
Last modification on : Sunday, June 26, 2022 - 12:01:59 PM
Long-term archiving on: : Wednesday, December 24, 2014 - 8:53:16 PM


Files produced by the author(s)


  • HAL Id : hal-01067217, version 1



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⟩



Record views


Files downloads