Automatic Programming Techniques Applied to Software Development An Approach Based on Exception Handling

  • Michel Bidoit
  • Francesca Losavio
  • Christian Gresse
  • Françoise Schlienger
Conference paper



A running system (APEX) is presented which provides powerful support to the user while designing programs with exception handling. This system automatically constructs ADA programs by decomposition of the data they deal with. Data are specified within a knowledge-base as algebraic data types having associated decomposition schemes and ADA implementations. Different These strategies may be combined with the decomposition schemes in order to build several programs solving the same problem. Emphasis is put on the fact that exception handling be used as a major automatic program construction technique.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Bar 79]
    BARSTOW D. Knowledge-based Program Construction Elsevier North Holland 1979.Google Scholar
  2. [BB 85]
    BIDOIT M., BIEBOW B., GAUDEL M.C.. GRESSE C., GUIHO G. Exception Handlting : Specifcattion and systemattic program construction IEEE Transactions on Software Engineering, Vol SE-11, Number 3, March 85.Google Scholar
  3. [Bid 84]
    BIDOIT M. Algebraic specifi caii On of exception handling and error recovery by means of declarations and equations 11th ICALP, AnIwerp, Belgium, pp 95108. 1984.Google Scholar
  4. [BGK 84]
    BIERMANN A., GUIHO G., KODRATOFF Y. Eds. Automatic Program Consiruction Techniques Macmillan Publishing Company, New York 1984.Google Scholar
  5. [BOR 82]
    BARTELS U., OLTHOFF W., RAULEFS P. An Expert Systern For Implementting Abstract Soriting Algorithms On Parametertized Abstract Data Types 7th IJCAI. Vancouver (Canada).Google Scholar
  6. [Gau 84]
    GAUDEL M.C. A First Introduction to PL USS Internal Repert, LRI 1984.Google Scholar
  7. [GHW 82]
    GUTTAG J., HORNING J., WING J. Some Notes on Putting Formal Specif cations to Productive Use SCP, Vol 2.1, October 1982.Google Scholar
  8. [Gog 77]
    GOGUEN J. Abstract Errors For Abstract Data Types Formal Description of Programming Concents E.J. NEUHOLD Ed., North Holland, New York 1977.Google Scholar
  9. [Gre 83]
    GRESSE C. Automnatic Programming from data types decompositions patterns 8th IJCAI, Karlsruhe (Germany), pp 37–39, 1983.Google Scholar
  10. [Gui 83]
    GUIHO G. Automatrc Programming Using Abstract Daia Types Keynote Address, 8th IJCAI, Karlsruhe (Germany), pp 1–9, 1983.Google Scholar
  11. [M 80]
    MANNA Z., WALDINGER R. A Deductive Approach To Program Synthesis ACM TOPLAS 2.1 pp 90–121, 1980.CrossRefzbMATHGoogle Scholar
  12. [Rey 70]
    REYNOLDS J.C. Gedanken : A Simple Typeless Language Based on the PrinCtiple of Completeness and the Reference Concept C.A.C.M., Vol. 13–5 pp 308–319, May 1970.zbMATHGoogle Scholar
  13. [Sch 84]
    SCHLIENGER F. Un environnement de programmation Ada intégrant des spéciflcations algébriques Thèse de 3ème cycle, Université PARIS XI, Février 1984.Google Scholar
  14. [SS 81]
    SCOTT D., SCHERLIS W. First Steps Towards Inferential Programming IFIP 83, pp 199–212.Google Scholar
  15. [Wat 82]
    WATERS R. The Progra mers’ Apprentice : Knowledge-Based Program Edtitting IEEE T. S. E., Vol SE-8 N 1, January 1982.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Michel Bidoit
    • 1
  • Francesca Losavio
    • 1
  • Christian Gresse
    • 2
  • Françoise Schlienger
    • 2
  1. 1.Laboratoire de Recherche en InformatiqueUniversité Paris-SudOrsayFrance
  2. 2.Laboratoire d’ InformatiqueUniversité d’ OrléansOrléansFrance

Personalised recommendations