Advertisement

A decidability problem of church-rosser specifications for program synthesis

  • Steffen Lange
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 265)

Abstract

The present paper is motivated by the aim to use inductive inference methods in the field of automatic program synthesis. For that reason, we give an algebraic framework for a comprehensive generalization of SUMMERS' approach by using Church-Rosser specifications of a special kind. Based on a brief description of a general program synthesis method we deduce a decidability problem forming a pure theoretical foundation of our method. Finally, we characterize some sufficient preconditions for making the decidability problem solvable.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature

  1. /1/.
    Angluin, D. & Smith, C.H., Inductive Inference: Theory and Methods, Computing Surveys, Vol. 15, No. 3, Sept. 1983, 237–269Google Scholar
  2. /2/.
    Blum, M., On the Size of Maschines, Information and Control, 11 (1967) 3, 257–265Google Scholar
  3. /3/.
    Davis M, HILBERT's tenth Problem is Unsolvable, America Math. Monthly, Vol. 80, 1983Google Scholar
  4. /4/.
    Ehrig, H. & Mahr, B., Fundamentals of Algebraic Specifications Part1, EATCS — Monographs on Theoretical Computer Science, Vol. 6, Springer-Verlag, 1985Google Scholar
  5. /5/.
    Huet, G. & Oppen, D.C., Equations and Rewrite Rules: A Survey, in: R.V. Book (ed.), Formal Languages: Peropectives and Open Problems, Academic Press, New York, 1980Google Scholar
  6. /6/.
    Klette, R. & Wiehagen, R., Research in the Theory of Inductive Inference by GDR Mathematicians-a Survey, Inf. Siences 22, 1980, 149–169Google Scholar
  7. /7/.
    Lange, St., A Program Synthesis Algorithm Exemplified, in: W. Biebel & K.P. Jantke (eds.), Proceedings of MMSSSS' 85, LNCS 215, Springer-Verlag, 1986, 185–194Google Scholar
  8. /8/.
    Summers, P.D., A Methodology for LISP Program Construction from Examples, JACM 24, 1978, 161–175Google Scholar
  9. /9/.
    Thomas, M., The Storage and Access Structure of Algebraically Specified Data Types, in: H.-D. Ehrich et al (eds.), Abstracts of the 4th Workshop on Specification of Abstract Data Types, Informatik-Berichte TU Braunschweig, Nr. 86-09Google Scholar
  10. /10/.
    Trakhtenbrot, B.A. & Barzdin, J.M., Finite Automata: Synthesis and Behaviour (russ.), Moskau 1970Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Steffen Lange
    • 1
  1. 1.Dept. of MathematicsHumboldt University BerlinBerlinGDR

Personalised recommendations