M. DEMBA
Dept. of Computer and Information Sciences
Aljouf University Skaka, Saudi Arabia

Abstract

Our aim is to outline a method for synthesizing a correct program that satises the intended semantics. The synthesized program is a specialization of the original one. In contrast to the previous approaches for logic program specialization, no negative examples are given as input but they will be discovered by the algorithm itself. The specialization process is performed according to the positive examples only. A method for rening logic programs into specialized version is then proposed.

keywords: program specialization, theorem proving, positive/negative examples, folding/unfolding rules, ¯nite-state machine.