Data Abstraction Transformations.

Abstract

A data abstraction is a collection of sets together with a collection of operations. Methods exist for specifying and for implementing data abstractions. The central question for any particular example is whether the semantics of each of these two methods corresponds with the intended abstraction. An algebraic comparison of data abstraction specifications and implementations is presented. It is shown that the specified and implemented abstractions always overlap and have a common (lattice) structure that is valuable in understanding the modification of code and specification. A new specification technique, 'table specification', is proposed that emphasizes the underlying congruence-class structure of data abstractions. Algorithms to transform tables are defined. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1980
Accession Number
ADA090136

Entities

People

  • Mark A. Ardis

Organizations

  • University of Maryland

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Computational Science
  • Computer Languages
  • Computer Programming
  • Computer Science
  • Computers
  • Grammars
  • Language
  • Linguistics
  • Programming Languages
  • Semantics
  • Specifications
  • Standards
  • Structured Programming
  • Theoretical Computer Science
  • Theses

Fields of Study

  • Computer science
  • Engineering
  • Geography

Readers

  • Computer Programming and Software Development.
  • Distributed Systems and Data Platform Development
  • Mathematical Modeling and Probability Theory.