Condition Recognition for a Program Synthesizer.
Abstract
An enumeration algorithm which synthesizes programs from example computations is presented. The algorithm, originally proposed by Alan W. Biermann of Duke University, assigns a labelling of the instructions contained in an example trace consistent with producing minimum state Moore machine representations for the synthesized programs. Techniques for processing the information to reduce enumeration are given. Biermann's algorithm is extended by trace preprocessing techniques which identify and generalize conditions on instruction sequencing in the synthesized programs without the user's assistance. The techniques are presented using text editing as the domain, but are general enough to be extendable into other domains. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 01, 1981
- Accession Number
- ADA104586
Entities
People
- Charles Wayne Miller
- Joseph Shawn Lape
Organizations
- Naval Postgraduate School