A system which synthesizes array-manipulating programs from specifications

Authors:
M. Bidoit;C. Gresse;G. Guiho
Affiliations:
Laboratoire de Recherche en Informatique, Universite de Paris-Sud, Orsay, France;Laboratoire de Recherche en Informatique, Universite de Paris-Sud, Orsay, France;Laboratoire de Recherche en Informatique, Universite de Paris-Sud, Orsay, France
Venue:
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 1
Year:
1979

Citing 4
Cited 1

A Methodology for LISP Program Construction from Examples

Journal of the ACM (JACM)
Strategies for the synthesis of algorithms

Proceedings of the 5. Fachtagung der GI
Goal-Directed Program Transformation

IEEE Transactions on Software Engineering
Constructing Programs from Example Computations

IEEE Transactions on Software Engineering

Automatic programming using abstract data types

IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.01

Visualization

Abstract

A System is presented for constructing array-manipulating programs from given specifications. The system accepts high level specifications and produces recursive programs in an Algol-like language. Restriction to a specific domain and use of powerful techniques such as first-order matching or generalization make our system very efficient. It has been implemented in LISP on a small computer and has been tested for a large number of examples. The general techniques we use, are briefly discussed and the synthesis of one program produced is presented.