Specifying abstract data types by restriction

Authors:
Theodore A. Linden
Affiliations:
Institute for Computer Sciences and Technology, National Bureau of Standards, Washington, D.C.
Venue:
ACM SIGSOFT Software Engineering Notes
Year:
1978

Citing 2
Cited 2

Implications of a virtual memory mechanism for implementing protection in a family of operating systems

Implications of a virtual memory mechanism for implementing protection in a family of operating systems
Limits of the "algebraic" specification of abstract data types

ACM SIGPLAN Notices

Invariants for specifications

ICSE '79 Proceedings of the 4th international conference on Software engineering
A note on logic-oriented approaches to data abstraction

ACM SIGSOFT Software Engineering Notes

Quantified Score

Hi-index	0.00

Visualization

Abstract

Restrictions are one instance of mathematically-based relationships between types that can be used to simplify program specifications. Restriction of an abstract data type provides a theoretical justification for the concept of a hidden function that appears in some current specification methodologies. The use of type restrictions to simplify formal specifications is illustrated by the example of traversible stacks.