Combinatorial Techniques for Proof-Based Synthesis of Sorting Algorithms - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Combinatorial Techniques for Proof-Based Synthesis of Sorting Algorithms

Résumé

In the frame of our previous experiments for proof based synthesis of sorting algorithms for lists and for binary trees, we employed certain special techniques which are able to generate multiple variants of sorting and merging, by investigating all combinations of auxiliary functions available for composing objects (lists, respectively trees). The purpose of this paper is to describe this technique and the results obtained. We present the main principles and the application of this technique to merging of sorted binary trees into a sorted one. Remarkably, merging requires a nested recursion, for which an appropriate induction principle is difficult to guess. Our method is able to find it automatically by using a general Noetherian induction and the combinatorial technique.
Fichier principal
Vignette du fichier
DraJebStr__2015a.pdf (217.95 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01590633 , version 1 (19-09-2017)

Identifiants

  • HAL Id : hal-01590633 , version 1

Citer

Isabela Dramnesc, Tudor Jebelean, Sorin Stratulat. Combinatorial Techniques for Proof-Based Synthesis of Sorting Algorithms. SYNASC 2015: 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Sep 2015, Timisoara, Romania. ⟨hal-01590633⟩

Collections

UNIV-LORRAINE
30 Consultations
145 Téléchargements

Partager

Gmail Facebook X LinkedIn More