Two impossibility theorems on behaviour specification of abstract data types

DOI10.1007/BF01185563zbMath0790.68080MaRDI QIDQ1323373

Oliver Schoett

Publication date: 10 May 1994

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

zbMATH Keywords

first-order logic; abstract data types; many-sorted algebras; behaviour specification; counter data type

Mathematics Subject Classification ID

03B70: Logic in computer science

68Q60: Specification and verification (program logics, model checking, etc.)

68Q65: Abstract data types; algebraic specification

Related Items

On behavioural abstraction and behavioural satisfaction in higher-order logic, Behavioural approaches to algebraic specifications. A comparative study, Essential concepts of algebraic specification and program development, Proof systems for structured specifications with observability operators, Closure properties for the class of behavioral models

Cites Work

• Observational implementation of algebraic specifications
• Behavioural correctness of data representations
• On observational equivalence and algebraic specification
• Toward formal development of programs from algebraic specifications: Implementations revisited
• Extended directed graphs, a formalism for structured data and data structures
• Data Type Specification: Parameterization and the Power of Specification Techniques
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item