Computer Science
Computer Science
bullet Special events show Rowan, Boro ever closer | More

bullet ‘Refuse to Sink’: Rowan to host consortium on suicide prevention | More

bullet Two Board of Trustees members return, three start first terms | More

bullet Sunday’s Rowan Open House cancelled | More

bullet Weather forecast won’t dampen Family Weekend fun at Rowan | 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.