Show simple item record

Files in this item


Item metadata

dc.contributor.advisorDyckhoff, Roy
dc.contributor.advisorSannella, Don
dc.contributor.authorThomas, Muffy
dc.coverage.spatial255 p.en_US
dc.description.abstractThe synthesis of imperative programs for hierarchical, algebraically specified abstract data types is investigated. Two aspects of the synthesis are considered: the choice of data structures for efficient implementation, and the synthesis of linked implementations for the class of ADTs which insert and access data without explicit key. The methodology is based on an analysis of the algebraic semantics of the ADT. Operators are partitioned according to the behaviour of their corresponding operations in the initial algebra. A family of relations, the storage relations of an ADT, Is defined. They depend only on the operator partition and reflect an observational view of the ADT. The storage relations are extended to storage graphs: directed graphs with a subset of nodes designated for efficient access. The data structures in our imperative language are chosen according to properties of the storage relations and storage graphs. Linked implementations are synthesised in a stepwise manner by implementing the given ADT first by its storage graphs, and then by linked data structures in the imperative language. Some circumstances under which the resulting programs have constant time complexity are discussed.en_US
dc.publisherUniversity of St Andrews
dc.subject.lcshElectronic data processingen
dc.titleThe imperative implementation of algebraic data typesen_US
dc.contributor.sponsorUniversity of St Andrewsen_US
dc.contributor.sponsorCommittee of Vice-Chancellors and Principals of the Universities of the United Kingdomen_US
dc.contributor.sponsorHilda Martindale Trusten_US
dc.contributor.sponsorInstitute of Chartered Secretaries and Administratorsen_US
dc.type.qualificationnamePhD Doctor of Philosophyen_US
dc.publisher.institutionThe University of St Andrewsen_US
dc.publisher.departmentStirling University Computing Science Departmenten_US

This item appears in the following Collection(s)

Show simple item record