Brake, Robert Blaine Boyd (1985) Implementation of data abstractions via an event based program transformation technique. Masters thesis, Memorial University of Newfoundland.
PDF (Migrated (PDF/A Conversion) from original format: (application/pdf))
- Accepted Version
Available under License - The author retains copyright ownership and moral rights in this thesis. Neither the thesis nor substantial extracts from it may be printed or otherwise reproduced without the author's permission.
Conventional data abstraction techniques enhance several aspects of a software system, its development, maintainability, reusability and comprehensibility. However, using conventional techniques one must manually implement a data abstraction and it's operators, which may result in an inefficient implementation. -- This paper introduces a program transformation technique which mechanically implements a fixed data abstraction with a limited set of efficient implementations. -- Within the limited scope, the event based technique has all the advantages of the conventional methods, as well as, automatic and efficient implementation by using an inline coding technique which is based on the properties (attributes) of the data representation being used to implement the data abstraction.
|Item Type:||Thesis (Masters)|
|Additional Information:||Bibliography: leaves 74-76.|
|Department(s):||Science, Faculty of > Computer Science|
|Library of Congress Subject Heading:||Data structures (Computer science); Automatic programming (Computer science)|
Actions (login required)