Verification and Correction of Non-Procedural Specifications in Automatic Generation of Programs.
Abstract
This dissertation deals with the design and implementation of an interactive Automatic Program Generator, which will generate PL/1 programs from a nonprocedural description of a problem in MODEL (MOdule DEscription Language). MODEL has many characteristics of very high level languages, being at the same time, descriptive. MODEL processor is quite tolerant of errors in a user specification (like incompleteness, inconsistencies, and ambiguities), and resolves those errors, either by generating additional statements, or by updating the user supplied statements. A special form of graph called, Array Graph, is used to represent the MODEL specification. Informally, an array graph is a compact representation of a conventional directed graph. Conventional graph algorithms are applied directly to the array graphs, and in particular, a necessary and sufficient condition for sequenceability of array graphs is derived. Array graph representation has been found quite useful in analyzing MODEL specifications consisting of iterations and recursions. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 15, 1978
- Accession Number
- ADA063900
Entities
People
- Subramanya K. Shastry
Organizations
- Moore School of Electrical Engineering