Combinatorial Techniques for Proof-Based Synthesis of Sorting Algorithms

Abstract

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… (More)
DOI: 10.1109/SYNASC.2015.30

Topics

1 Figure or Table