Why and how program synthesis?

1. W. W. Agresti: New Paradigms for Software Development; IEEE Computer Society Press, North-Holland, Washington, DC.

   Google Scholar 

2. S. Amarel: On Representations of Problems of Reasoning about Actions; [webber01], 2–22.

   Google Scholar 

3. J. Arsac, Y. Kodratoff: Some Techniques for Recursion Removal from Recursive Functions; ACM Transactions on Programming Languages and Systems, Vol. 4, No. 2, April, 1982, 295–322.

   Google Scholar 

4. N. Azibi: TREQUASI: Un système pour la transformation automatique de programmes PROLOG récursifs en quasi-itératifs; Thesis, Univ. de Paris Sud, Centre d'Orsay, 1987.

   Google Scholar 

5. W. Bibel, K. M. Hoernig: LOPS — A System Based on a Strategical Approach to Program Synthesis; [biermann01], 1984, 69–91.

   Google Scholar 

6. A. Biermann, G. Guiho, Y. Kodratoff (ed): Automatic Program Construction Techniques; Macmillan Publishing Company, London, 1984.

   Google Scholar 

7. A. Biermann: Some Examples of Program Synthesis; [biermann01], 1984, 553–562.

   Google Scholar 

8. S. Biundo, Frantisek Zboray: Existence proofs by induction using methods of program synthesis; Interner Bericht 16/84, Universitat Karlsruhe, 1984.

   Google Scholar 

9. R.M. Burstall, J. Darlington: A transformation system for developping recursive programs; J.ACM 24, 1, January, 1977, 44–67.

   Google Scholar 

10. N. Dershowitz: Synthesis by Completion; [joshi02], 208–214.

    Google Scholar 

11. M. Franova: Precomas Challenge; Rapport de Recherche No.376, L.R.I., Université de Paris-Sud, Orsay, France, September, 1987.

    Google Scholar 

12. M. Franova: CM-strategy: A Methodology for Inductive Theorem Proving or Constructive Well-Generalized Proofs; [joshi02], 1985, 1214–1220.

    Google Scholar 

13. M. Franova: An Implementation of Program Synthesis from Formal Specifications; [kodratoff23], 559–564.

    Google Scholar 

14. M. Franova: Fundamentals for a new methodology for inductive theorem proving: CM-construction of atomic formulae; [kodratoff23], 137–141.

    Google Scholar 

15. M. Franova: Fundamentals of a new methodology for Program Synthesis from Formal Specifications: CM-construction of atomic formulae; Thesis, Université Paris-Sud, November, Orsay, France, 1988.

    Google Scholar 

16. B. Fronhofer: The LOPS-Approach: Towards New Syntheses of Algorithms; [trost01], 108–119.

    Google Scholar 

17. S. Goto: Program Synthesis from natural deduction proofs; in: Proceedings of the Sixth International Joint Conference on Artificial Intelligence, August 1979, Tokyo, 339–341.

    Google Scholar 

18. C.J. Hogger: Derivation of logic programs; J.ACM vol. 28, no. 2, 1981, 372–392.

    Google Scholar 

19. C.J. Hogger: Introduction to Logic Programming; Academic Press, Inc., London, 1984.

    Google Scholar 

20. A.K. Joshi, (ed.): Proceedings of the Ninth International Joint Conference on Artificial Intelligence; August, Los Angeles, 1985.

    Google Scholar 

21. Y. Kodratoff, M.Picard: Complétion de systèmes de réécriture et synthèse de programmes à partir de leurs spécifications; Bigre No.35, October, 1983.

    Google Scholar 

22. Y. Kodratoff: An Introduction to Machine Learning; Pitman, London, 1988.

    Google Scholar 

23. Y. Kodratoff: Proceedings of the 8th European Conference on Artificial Intelligence; August 1–5, Pitman, London, United Kingdom, 1988.

    Google Scholar 

24. R. Kowalski: The relation between logic programming and logic specification; Phil. Trans. R. Soc. Lond., 1984.

    Google Scholar 

25. G. Kreisel: Some Uses of Proof Theory for Finding Computer Programs; Colloque International de Logique, Clermont-Ferrand, July, 1975.

    Google Scholar 

26. P. Leith: Fundamental Errors in Legal Logic Programming, in The Computer Journal, Vol.29, NO.6,1986.

    Google Scholar 

27. P.Leith: Definition and Logic: Learning from the failure of AI, to appear in "AI and Software Engineering", D. Partridge (ed.), Albex: NY.

    Google Scholar 

28. J. W. Lloyd: Foundations of Logic Programming; Springer-Verlag, Berlin, 1984.

    Google Scholar 

29. Z. Manna, R. Waldinger: A Deductive Approach to Program Synthesis; ACM Transactions on Programming Languages and Systems, Vol. 2., No. 1, January, 1980, 90–121.

    Google Scholar 

30. D. Partridge: AI: applicationas in the future of software engineering; Ellis Horwood/Wiley, United Kingdom, 1986.

    Google Scholar 

31. H. Perdrix: Program synthesis from specifications; ESPRIT'85, Status Report of Continuing Work, North-Holland 1986, 371–385.

    Google Scholar 

32. H. Perdrix: Program synthesis from specifications; in: Ph. Jorrand and V. Sgurev (eds): Proceeding of AIMSA '86, North-Holland, 13–21.

    Google Scholar 

33. R. Péter: Recursive Functions; Academic Press, New York, 1967.

    Google Scholar 

34. I. Plander, (eds): Proceedings of Artificial Intelligence and Information-Control Systems of Robots-87; Bratislava, October, North-Holland, 1987.

    Google Scholar 

35. Ch. Rich, R. C. Waters (eds): Reading in Artificial Intelligence and Software Engineering; Morgan Kaufmann, Los Altos, CA, 1986.

    Google Scholar 

36. M. Sato: Towards a Mathematical Theory of Program Synthesis; Proc. 6th IJCAI, Tokyo, 1979, 757–762.

    Google Scholar 

37. N. Tareb, Y. Kodratoff: Synthesis of Specifications from Programs; [plander01], 467–471.

    Google Scholar 

38. H. Trost, J. Retti (eds): ÖGAI-85; Vienna, Austria, Informatik-Fachberichte 106, September, Springer-Verlag, 1985.

    Google Scholar 

39. R. Waldinger: Achieving Several Goals Simultaneously; [webber01], 250–271.

    Google Scholar 

40. B. L. Webber, N. N. Nilson: Readings in Artificial Intelligence; Morgan Kaufmann, Los Altos, California, 1981.

    Google Scholar 

Download references