Crypt-equivalent algebraic specifications

DOI10.1007/BF02737100zbMath0632.68024OpenAlexW4254372009MaRDI QIDQ1095646

Martin Wirsing, Friedrich L. Bauer

Publication date: 1988

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

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

zbMATH Keywords

predicate logicpositive definabilityabstract semantic equivalencecrypt-equivalencefirst- order modelsimplementation equivalenceinductive simulation equivalencesemantic analysis of algebraic specificationsterm-generated models

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (1)

Randnomness, computability, and algebraic specifications

Cites Work

• On hierarchies of abstract data types
• Algebraic implementations preserve program correctness
• Final algebra semantics and data type extensions
• Algebraic implementation of abstract data types
• Proof of correctness of data representations
• On the Theory of Specification, Implementation, and Parametrization of Abstract Data Types
• Initial Algebra Semantics and Continuous Algebras
• Abstract data types and software validation
• Simplification of the set of four postulates for Boolean algebras in terms of rejection
• The Theory of Representation for Boolean Algebras
• Ein vereinfachtes Axiomensystem für Gruppen.
• A simple transfer lemma for algebraic specifications
• 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: Crypt-equivalent algebraic specifications