Computer Science
Computer Science
bullet Rowan students offer free tax preparation assistance through VITA program | More

bullet Rowan alumnus to be honored during 2016 Delaware Valley Engineers Week | More

bullet Pediatrician to share his experiences working with victims of Darfur genocide | More

bullet Celebrating President’s Day: Historian’s talk to focus on Andrew Johnson's presidency | More

bullet Sharing big ideas: Rowan Paleontologist to deliver TED Talk at 2016 TED Conference | 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.