Algebraic implementation of abstract data types

DOI10.1016/S0304-3975(82)80001-7zbMath0483.68018OpenAlexW1983608286MaRDI QIDQ1163361

Bernd Mahr, Peter Padawitz, Hartmut Ehrig, Hans-Joerg Kreowski

Publication date: 1982

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(82)80001-7

zbMATH Keywords

identificationsynthesiscorrectnessrestrictionrecursive programshash-tablesimplementations for algorithm in specific programming languages

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (32)

Structured algebraic specifications: A kernel language ⋮ Abstract data types with exception handling: An initial approach based on a distinction between exceptions and errors ⋮ On the implementation of abstract data types by programming language constructs ⋮ Algebraic specification of modules and their basic interconnections ⋮ On observational equivalence and algebraic specification ⋮ Toward formal development of programs from algebraic specifications: Implementations revisited ⋮ Crypt-equivalent algebraic specifications ⋮ Equational specification of partial higher-order algebras ⋮ Specifications in an arbitrary institution ⋮ Correctness proofs for abstract implementations ⋮ Essential concepts of algebraic specification and program development ⋮ Observational implementations ⋮ Proof systems for structured specifications with observability operators ⋮ Specification of abstract dynamic-data types: A temporal logic approach ⋮ Observational implementation of algebraic specifications ⋮ Complexity of algebraic implementations for abstract data types ⋮ Algebraic specification of concurrent systems ⋮ Algebraic implementation of abstract data types: a survey of concepts and new compositionality results ⋮ An incremental approach to automatic algorithm design ⋮ Context induction: A proof principle for behavioural abstractions and algebraic implementations ⋮ On the correctness of modular systems ⋮ A semi-algorithm for algebraic implementation proofs ⋮ Abstract implementation of algebraic specifications in a temporal logic language ⋮ Toward formal development of programs from algebraic specifications: Model-theoretic foundations ⋮ Compatibility of parameter passing and implementation of parameterized data types ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Swinging types=functions+relations+transition systems ⋮ A hidden agenda ⋮ Parameter passing in algebraic specification languages ⋮ The Foundational Legacy of ASL ⋮ A constructive method for abstract algebraic software specification

Cites Work

• Final algebra semantics and data type extensions
• Complexity of algebraic implementations for abstract data types
• The notions of consistency and predicate locks in a database system
• Extensions and implementations of abstract data type specifications
• Abstract data types and software validation
• Data type specification
• Program development by stepwise refinement
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algebraic implementation of abstract data types