Computer Science
Computer Science
bullet Passing the torch: Record-setting Class of 2018 urged to uphold traditions, seize opportunities | More

bullet Move-in Tips For #Rowan18 | More

bullet Home Sweet Rowan: Intensive training program prepares RAs to serve residential students | More

bullet Welcome, Profs! Programs, initiatives focus on campus engagement from the start | More

bullet Profs gearing up for memorable fall sports campaigns | More

Technical Report Number TR1997-1

Title
A theorem on refinement operators for logic program synthesis

Author
Nancy Lynn Tinkham
Department of Computer Science
Rowan University
Glassboro, NJ 08028
E-mail: nlt@rowan.edu

Abstract

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.