Abstract
There have been many recent proposals for embedding abstract data types in programming languages. In order to reason about programs using abstract data types, it is desirable to specify their properties at an abstract level, independent of any particular implementation. This paper presents an algebraic technique for such specifications, develops some of the formal properties of the technique, and shows that these provide useful guidelines for the construction of adequate specifications.
Supported in part by the National Science Foundation under grant MCS-76-06089 and the Joint Services Electronics Program monitored by the Air Force Office of the Scientific Research under contract F44620-76C-0061.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1978 Springer-Verlag New York Inc
About this chapter
Cite this chapter
Guttag, J.V., Horning, J.J. (1978). The Algebraic Specification of Abstract Data Types. In: Gries, D. (eds) Programming Methodology. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-6315-9_21
Download citation
DOI: https://doi.org/10.1007/978-1-4612-6315-9_21
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6317-3
Online ISBN: 978-1-4612-6315-9
eBook Packages: Springer Book Archive