Computer Science
Computer Science
bullet Hail to the Profs! Homecoming 2014 in pictures | More

bullet Second biennial ScholarFest to celebrate Rowan research | More

bullet Rowan hosts talk on “Controlling Ebola Virus Outbreaks: A New Strategy to Block Virus Transmission and Spread” | More

bullet Prof pride: Alumni flock to campus for Homecoming | More

bullet ‘Networking With Style’: Barefoot Cellars founders to discuss their road to wine-selling success during South Jersey Soiree | 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.