The algebraic specification of abstract data types

DOI10.1007/BF00260922zbMath0369.68010OpenAlexW2134338128MaRDI QIDQ1243118

J. V. Guttag, J. J. Horning

Publication date: 1978

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00260922

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items (37)

A proof method for local sufficient completeness of term rewriting systems ⋮ Trace rewriting systems ⋮ On sufficient completeness of conditional specifications ⋮ Design strategies for rewrite rules ⋮ Software perfective maintenance: Including retrainable software in software reuse ⋮ Generalization of final algebra semantics by relativization ⋮ Proof by consistency ⋮ Priority rewriting: Semantics, confluence, and conditionals ⋮ The negation elimination from syntactic equational formula is decidable ⋮ Algebraic specifications of computable and semicomputable data types ⋮ Equational specification of partial higher-order algebras ⋮ Equational problems and disunification ⋮ The behavior-realization adjunction and generalized homomorphic relations ⋮ Sufficient completeness verification for conditional and constrained TRS ⋮ About the implementability and the power of equationally defined data abstractions ⋮ Abstract data types and algebraic semantics of programming languages ⋮ Specification and proof in membership equational logic ⋮ When is an extension of a specification consistent? Decidable and undecidable cases ⋮ Using induction and rewriting to verify and complete parameterized specifications ⋮ Transformations and confluence for rewrite systems ⋮ Modal logic and algebraic specifications ⋮ Synthesizing implementations of abstract data types from axiomatic specifications ⋮ Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications ⋮ Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness ⋮ Semantics of multiway dataflow constraint systems ⋮ Methodical solution of the problem of ascending subsequences of maximum length within a given sequence ⋮ Automating inductionless induction using test sets ⋮ Unnamed Item ⋮ Approximation properties of abstract data types ⋮ A view of computability on term algebras ⋮ Implementation of data types by algebraic methods ⋮ A constructive method for abstract algebraic software specification ⋮ A systematic study of models of abstract data types ⋮ On the data type extension problem for algebraic specifications ⋮ Two congruent semantics for Prolog with CUT ⋮ Comparing data type specifications via their normal forms ⋮ Constructing specification morphisms

This page was built for publication: The algebraic specification of abstract data types