A Case Study on Algorithm Discovery from Proofs: The Insert Function on Binary Trees

Isabela Dramnesc (1) , Tudor Jebelean (2) , Sorin Stratulat (3)

1 UVT - Universitatea de Vest din Timișoara [România] = West University of Timișoara [Romania] = Université Ouest de Timișoara [Roumanie]
2 RISC - Research Institute for Symbolic Computation
3 LITA - Laboratoire d'Informatique Théorique et Appliquée

We present a proof–based automatic synthesis experiment in the context of sorting binary trees, namely the synthesis of the function which inserts an element in a sorted binary tree at the appropriate place. The algorithm is automatically extracted from the automatically produced proof of the conjecture which expresses the existence of the desired output for each appropriate input of the function. This is a case study with the purpose of finding and illustrating general and domain specific inference rules and strategies for efficiently producing proofs from which the desired algorithms can be extracted. The construction of the necessary theory, of the provers, and the experiment itself are performed in the Theorema system.

Domaines: Calcul formel [cs.SC]

Isabela Dramnesc, Tudor Jebelean, Sorin Stratulat. A Case Study on Algorithm Discovery from Proofs: The Insert Function on Binary Trees. SACI 2016: 11th IEEE International Symposium on Applied Computational Intelligence and Informatics, May 2016, Timisoara, Romania. ⟨hal-01590637⟩