Two impossibility theorems on behaviour specification of abstract data types

DOI10.1007/BF01185563zbMath0790.68080OpenAlexW2020817341MaRDI QIDQ1323373

Oliver Schoett

Publication date: 10 May 1994

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

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

zbMATH Keywords

first-order logicabstract data typesmany-sorted algebrasbehaviour specificationcounter data type

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Related Items

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

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