Implementation of the Extended Program Model.
Abstract
The goal of the Program Reference Language is to construct multiple representations of a program that facilitate queries on the code structure. The fifth year of this program focused on the implementation of a data and control flow model of programs, called Losp. A subset of Ada programs is transcribed into Lisp and then into Pure LISP. The Losp representation is constructed from Pure LISP by converting logical control structures to configurations of boundary tokens (parentheses). The distinction network representation is constructed by distributing boundary tokens and functional definitions over a network in which nodes represent procedure names and variables, and arcs represent function-argument dependencies. Distinction networks can be interpreted to yield functionally invariant code, and they can be queried as objects about their control and data flow structure.
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 01, 1986
- Accession Number
- ADA181162
Entities
People
- Brian P. Mccune
- Sonia O. Lyris
- Susan G. Rosenbaum
- William M. Bricken