PRECOMAS an implementation of constructive matching methodology

Authors:
M. Franová
Affiliations:
CNRS & Universitéé Paris Sud, LRI, Bldg 490, 91405 Orsay, France
Venue:
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
Year:
1990

Citing 3
Cited 0

Top-down synthesis of divide-and-conquer algorithms

Artificial Intelligence
A Deductive Approach to Program Synthesis

ACM Transactions on Programming Languages and Systems (TOPLAS)
Automatic Program Construction Techniques

Automatic Program Construction Techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

The system PRECOMAS (PRoofs Educed by COnstructive MAtching for Synthesis) implements the Constructive Matching methodology for automatic constructions of programs from formal specifications.In this paper we describe briefly the goal of PRECOMAS, its logical background and the CM method applied to proving atomic formulae. We show how the user of our system is involved in solving a program synthesis problem. We show that this interaction does not concern the problem of guiding the program synthesis process, this being solved by CM. Our experimental version serves to confirm that the system is worth to be developed.