Algorithmic specifications: a constructive specification method for abstract data types
- 1 October 1987
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 9 (4) , 646-661
- https://doi.org/10.1145/29873.30399
Abstract
This paper presents a new specification method for abstract data types and a pertaining logic. The specification method proposed differs from the classical algebraic one by its constructive, yet abstract nature. Although it leads to a different style in specification, the method avoids some fundamental problems inherent in the algebraic specification method. The logic proposed is essentially a first-order logic for strict (partial) functions. It allows in particular the expression of the semantic conditions guaranteeing the consistency of a specification.Keywords
This publication has 21 references indexed in Scilit:
- On the data type extension problem for algebraic specificationsTheoretical Computer Science, 1985
- A constructive method for abstract algebraic software specificationTheoretical Computer Science, 1984
- A systematic study of models of abstract data typesTheoretical Computer Science, 1984
- Parameterized Specifications: Parameter Passing and Implementation with Respect to ObservabilityACM Transactions on Programming Languages and Systems, 1983
- Final Data Types and Their SpecificationACM Transactions on Programming Languages and Systems, 1983
- Data Type Specification: Parameterization and the Power of Specification TechniquesACM Transactions on Programming Languages and Systems, 1982
- On the Theory of Specification, Implementation, and Parametrization of Abstract Data TypesJournal of the ACM, 1982
- Algebraic specification of data types: A synthetic approachTheory of Computing Systems, 1981
- Final algebra semantics and data type extensionsJournal of Computer and System Sciences, 1979
- Abstract data types and software validationCommunications of the ACM, 1978