Skip to main content
SpringerLink
Log in
Book cover

European Software Engineering Conference

ESEC 1987: ESEC '87 pp 337–347Cite as

Automatic program synthesis from data structures

Synthese Automatique de Programme A Partir des Structures de Donnees

  • XI — Arrows, Boxes, Circles (2)
  • Conference paper
  • First Online:

  • 140 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 289))

Abstract

A system for the automatic synthesis of a program from the specification of its in and out data-structures, functional relations between elementary data and correspondences between structured data is presented. The structure of the program to synthetize results from a constrained unification of the data structures. The instructions which are added to the leaves of the program structure are mainly deduced from the functional relations between elementary data. The control structures (while-do, if-then) come implicitly from the program structure. This paper describes the behaviour of our system on simple problems (one in and one out file), but programs involving many files in entrance, and/or comprising "structure collisions", or "structure clashes" are under the scope of it.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. ENSELME D., VEDA 2, un système de synthèse de programmes dirigée par les données, Thèse de 3ème cycle, Université PARIS VI, December 1985.

    Google Scholar 

  2. HOFFMAN C.M., O'DONNELL M.J., Pattern matching in trees, JACM Vol. 29 no1, January 1982.

    Google Scholar 

  3. HUGUES J.W., A formalisation and explication of the M. JACKSON method of program design, Software Practice & Experience, Vol 9, 1979.

    Google Scholar 

  4. JACKSON M., Principle of programming design, Academic Press, Londres, 1975.

    Google Scholar 

  5. KUO-CHONG TAI, The tree-to-tree correction problem, JACM, Vol 26 no3, July 1979.

    Google Scholar 

  6. SIMON H.U., Pattern matching in trees and sets, Acta Informatica, Vol 20 no20, 1983.

    Google Scholar 

  7. WARNIER J.D., Précis de logique informatique, Les Editions d'Organisation, Paris, 1973.

    Google Scholar 

  8. WILSON A.D., Programs to process trees, representing program structures and data structure, Software Practice & Experience, Vol 14, September 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Intelligence Artificielle Appliquée, Conservatoire National des Arts et Métiers, 292 rue Saint Martin, 75141, Paris Cedex 03, France

    Daniel Enselme, Gérard Benay & F.-Y. Villemin

Authors
  1. Daniel Enselme
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gérard Benay
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. F.-Y. Villemin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Howard Nichols Dan Simpson

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Enselme, D., Benay, G., Villemin, FY. (1987). Automatic program synthesis from data structures. In: Nichols, H., Simpson, D. (eds) ESEC '87. ESEC 1987. Lecture Notes in Computer Science, vol 289. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022126

Download citation

  • DOI: https://doi.org/10.1007/BFb0022126

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18712-7

  • Online ISBN: 978-3-540-48117-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation