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

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 present some properties of multisets comparedto sets, regarding the relations and
operations between multisets, in an attempt to simplify the analysis of multisets. We …

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 demonstrate the automatic proof–based synthesis of merging and inserting algorithms
for [sorted] binary trees, using the notion of multisets, in the Theorema system. Each …

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 …

We introduce Venn diagrams for multisets and showhow they simplify the analysis of
multisets. Venn diagrams arevery useful in proofs involving multisets and multiset orders …