Computer Science
Computer Science
bullet Director of Student Activities Constantine Alexakos to deliver Rowan’s ‘Last Lecture’ | More

bullet Holiday Week celebrations planned by Rowan’s SGA | More

bullet ‘Shooting For Santa’ toy drive to benefit South Jersey children | More

bullet Extended hours at Campbell Library for final exams | More

bullet Hollywood comes to campus: Rowan hosts collegiate premier of Carol | More

Technical Report Number TR1997-1

A theorem on refinement operators for logic program synthesis

Nancy Lynn Tinkham
Department of Computer Science
Rowan University
Glassboro, NJ 08028


Upward and downward refinement operators can be used to order the space of program schemata; these operators make program generalization and synthesis more efficient. This paper presents a theorem relating a pair of refinement operators to the sets of goals covered by schemata.