Representing data paths by program structures
Loading...
Files
Date
1979
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
This paper discusses an approach to using program fragments to characterise data aggregates (or "data paths"). The main topic of the paper is the use of this representation to specify assignments between data paths. The approach allows certain assignments between paths to be represented in a conceptually simpler manner than would be the case for conventional techniques.