Proof–based Synthesis of Sorting Algorithms for Trees - Archive ouverte HAL Access content directly
Conference Papers Year :

Proof–based Synthesis of Sorting Algorithms for Trees


e develop various proof techniques for the synthesis of sorting algorithms on binary trees, by extending our previous work on the synthesis of algorithms on lists. Appropriate induction principles are designed and various specific prove-solve methods are experimented, mixing rewriting with assumption-based forward reasoning and goal-based backward reasoning à la Prolog. The proof techniques are implemented in the Theorema system and are used for the automatic synthesis of several algorithms for sorting and for the auxiliary functions, from which we present few here. Moreover we formalize and check some of the algorithms and some of the properties in the Coq system.
Fichier principal
Vignette du fichier
DraJebStr__2016.pdf (415.35 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01590645 , version 1 (21-09-2017)



Isabela Dramnesc, Tudor Jebelean, Sorin Stratulat. Proof–based Synthesis of Sorting Algorithms for Trees. 140th International Conference on Language and Automata Theory and Applications (LATA 2016), Mar 2016, Prague, Czech Republic. pp.562-575, ⟨10.1007/978-3-319-30000-9_43⟩. ⟨hal-01590645⟩


52 View
174 Download



Gmail Facebook Twitter LinkedIn More