We develop logic and combinatorial methods for automating the generation of sorting
algorithms for binary trees, starting from input-output specifications and producing …

We 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 …

Using multisets, we develop novel techniques for mechanizing the proofs of the synthesis
conjectures for list–sorting algorithms, and we demonstrate them in the Theorema system …

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 …

Using multisets, we develop novel techniques for mechanizing the proofs of the synthesis
conjectures for list-sorting algorithms, and we demonstrate them in the Theorema system …

We address the automation of the processes of algorithm synthesis and systematic
exploration of the theory of lists. Our focus is on methods, techniques, inference rules and …

In the context of constructive synthesis of sorting algorithms, starting from the specification of
the problem (input and output conditions), the proof of existence of a sorted tuple is …

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 …

Mathematics is a technique of solving problems and the essence of mathematics is proving.
By reasoning about the problems we obtain knowledge. This knowledge can be managed …

We present the systematic build-up in the Theorema system of the theory of lists. This was
carried out in parallel with the process of synthesis of some sorting algorithms in the same …