Abstract
A number of strategies for the construction of algorithms from a given input-output specification of a problem are presented. Their application is illustrated by a detailed synthesis of the usual MAXIMUM algorithm, a search algorithm LOCATE and Hoares FIND algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bibel, W., Programmieren in der Sprache der Prädikatenlogik, Habilitationsarbeit (eingereicht), Technische Universität München, 1975; shorter versions of it: Prädikatives Programmieren, Lact. Notes Comp. Sc., vol. 33, Springer, Berlin and New York, 274–283, 1975. Predicative programming, Séminaires IRIA I975/76, Roquencourt, to appear.
Bibel, W., Synthesis of strategic definitions and their control, report 7610, Technische Universität München, May 1976.
Bibel, W., A uniform approach to programming, report 7633, Technische Universität München, 1976.
Bledsoe, W., Set variables. Fifth International Joint Conference on Artificial Intelligence, Cambridge, 501–510, 1977.
Brown, F.M., A theorem prover for elementary set theory. Fifth International Joint Conference on Artificial Intelligence, Cambridge, 534–540, 1977.
Brown, F.M., Tärnlund, S.A., Inductive reasoning in mathematics, report No. 30, Department of Artificial Intelligence, University of Edinburgh, 1977.
Buchanan, J.R. and Luckham, D.C., On automating the construction of programs. Memo AIM-236, Stanford A.I. Lab. 1974.
Darlington, John, A synthesis of several sorting algorithms. Report 23, Dept. Artif. Intell., Univ. of Edinburgh, 1976.
Dershowitz, N., Manna, Z., On automating structured programming, Conference on Proving and Improving Programs, Arc et Senans, p. 167–193, 1975.
Floyd, R.W., Toward interactive design of correct programs, Proc. of IFIP Congress 1971, Ljubljana, North Holland, I1-I4, 1971.
Green, C. and Barstow, D., Program synthesis knowledge for efficient sorting, Artif. Intell. Lab., Stanford Univ., March 1977.
Hoare, C.A.R., Algorithm 63 (Partition) and Algorithm 65 (Find), CACM, Vol. 4, No. 7, 321–322, 1961.
Kowalski, R., Algorithm = Logic + Control, Imperial College, London, 1976.
Low, J., Rovner, P., Techniques for the automatic selection of data structures, 3rd ACM symposium on principles of programming languages, 1976.
Manna, Z. and Waldinger, R., Toward automatic program synthesis. Comm. ACM, 14, No. 3, 151–165, 1971.
Manna, Z. and Waldinger, R., The automatic synthesis of recursive programs, Proc. of Symp. on Artif. Intell. and Programming Languages, Rochester, ACM, 29–36, 1977.
Sandewall, E., PCF2 a First Order Calculus for Expressing Conceptual Information, Dept. of Comput. Sci., Uppsala Univ. at Uppsala, Sweden, 1972.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1978 Springer-Verlag Berlin · Heidelberg
About this chapter
Cite this chapter
Bibel, W., Furbach, U., Schreiber, J.F. (1978). Strategies for the Synthesis of Algorithms. In: Alber, K. (eds) Programmiersprachen. Informatik - Fachberichte, vol 12. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-87956-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-87956-2_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08680-2
Online ISBN: 978-3-642-87956-2
eBook Packages: Springer Book Archive