Theory Exploration of Binary Trees - Archive ouverte HAL Access content directly
Conference Papers Year :

Theory Exploration of Binary Trees


The construction of a theory for binary trees is presented, based on the systematic exploration of the properties necessary for the proof-based synthesis and certification of sorting algorithms for binary trees. The process is computer supported, being realised in the frame of the Theorema system, with some additional proofs in Coq required for algorithm certification. The result of the exploration consists in 11 definitions, 3 axioms, and more than 200 properties. Also, more than 5 algorithms for sorting binary trees are generated.
Fichier principal
Vignette du fichier
sisy2015.pdf (181.58 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01235173 , version 1 (28-11-2015)


  • HAL Id : hal-01235173 , version 1


Isabela Dramnesc, Tudor Jebelean, Sorin Stratulat. Theory Exploration of Binary Trees. 13th IEEE International Symposium on Intelligent Systems and Informatics, SISY 2015, Sep 2015, Subotica, Serbia. pp.139-144. ⟨hal-01235173⟩


33 View
237 Download


Gmail Facebook Twitter LinkedIn More