On observational equivalence and algebraic specification

DOI10.1016/0022-0000(87)90023-7zbMath0619.68028OpenAlexW2162643525MaRDI QIDQ1089796

Andrzej Tarlecki, Donald Sannella

Publication date: 1987

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(87)90023-7

Mathematics Subject Classification ID

Data structures (68P05)

Related Items

Observational logic, constructor-based logic, and their duality., Constructor-based observational logic, Behavioural approaches to algebraic specifications. A comparative study, Toward formal development of programs from algebraic specifications: Implementations revisited, Category-based modularisation for equational logic programming, Specifications in an arbitrary institution, Essential concepts of algebraic specification and program development, Testing can be formal, too, May I borrow your logic? (Transporting logical structures along maps), Proof systems for structured specifications with observability operators, The definition of Extended ML: A gentle introduction, The behavior-realization adjunction and generalized homomorphic relations, Proof theory of higher-order equations: Conservativity, normal forms and term rewriting., Algebraic implementation of abstract data types: a survey of concepts and new compositionality results, Correctness of concurrent processes, Modularising the specification of a small database system in extended ML, Observational interpretations of hybrid dynamic logic with binders and silent transitions, Behavioural theories and the proof of behavioural properties, On behavioural abstraction and behavioural satisfaction in higher-order logic, Observational specifications and the indistinguishability assumption, On the correctness of modular systems, Parchments for CafeOBJ Logics, Behavioral abstraction is hiding information, Behavioural and abstractor specifications revisited, Toward formal development of programs from algebraic specifications: Model-theoretic foundations, On behavioural abstraction and behavioural satisfaction in higher-order logic, On the complexity of the clone membership problem, The Foundational Legacy of ASL, Prelogical relations, Toward formal development of programs from algebraic specifications: Parameterisation revisited, Two impossibility theorems on behaviour specification of abstract data types, Behavioural satisfaction and equivalence in concrete model categories

Cites Work

• Algebraic and operational semantics of specifications allowing exceptions and errors
• Structured algebraic specifications: A kernel language
• On the existence of free models in abstract algebraic institutions
• Final algebra semantics and data type extensions
• CLU reference manual
• Algebraic implementation of abstract data types
• Partial abstract types
• Testing equivalences for processes
• On the Theory of Specification, Implementation, and Parametrization of Abstract Data Types
• Data Type Specification: Parameterization and the Power of Specification Techniques
• Final Data Types and Their Specification
• Axioms for abstract model theory
• Initial Algebra Semantics and Continuous Algebras
• Parameterized Specifications: Parameter Passing and Implementation with Respect to Observability
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item