Semi-automatic Synthesis of Some Sorting Programs in Theorema

Semi-automatic Synthesis of Some Sorting Programs in Theorema

Cached

Download Links

[www.risc.jku.at]

by Isabela Drămnesc , Tudor Jebelean

BibTeX

@MISC{Drămnesc_semi-automaticsynthesis,
    author = {Isabela Drămnesc and Tudor Jebelean},
    title = {Semi-automatic Synthesis of Some Sorting Programs in Theorema},
    year = {}
}

Bookmark

OpenURL

Abstract

Abstract. In the context of constructive synthesis we present a general method for synthesis of seven versions of sorting algorithms and the synthesis of some necessary auxiliary functions. We synthesize also new algorithms like: Special Merge-Sort and Special Quick-Sort. The method that we implemented in the Theorema system and the case studies presented in this paper complement the work from [8]. The synthesis process is paralleled with the exploration of the appropriate theory of lists. 1

Citations

191	The Mathematica Book - Wolfram - 1996
59	Theorema: Towards Computer-Aided Mathematical Theory Exploration - Buchberger, Craciun, et al.
51	Top-down synthesis of divide-and-conquer algorithms - Smith - 1985
40	A synthesis of several sorting algorithms - Darlington - 1978
22	On Program Synthesis Knowledge - Green, Barstow
19	Top-down Synthesis of Recursive Logic Procedures from First-order Logic Specifications - Lau, Prestwich - 1990
16	Algorithm classification through synthesis - Clark, Darlington - 1980
12	The design of divide and conquer algorithms - Smith - 1985
9	Theory Exploration with Theorema - Buchberger - 2000
9	Synthesis of a Family of Recursive Sorting Procedures - Lau, Prestwich - 1991
7	A Note on Synthesis and Classification of Sorting Algorithms - Lau - 1989
5	Top-down synthesis of sorting algorithms - Lau - 1992
2	Remarks on “A synthesis of several sorting algorithms” by - Barstow - 1980
1	Automated Reasoning on Tuples - Case Studies in Proof Based Synthesis - Dramnesc, Jebelean - 2011
1	Proof Techniques for Synthesis of Sorting Algorithms - Dramnesc, Jebelean