Behavioural correctness of data representations

DOI10.1016/0167-6423(90)90057-KzbMath0699.68031OpenAlexW2027949780MaRDI QIDQ913484

Oliver Schoett

Publication date: 1990

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6423(90)90057-k

zbMATH Keywords

many-sorted algebrasabstract data type theory

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Data structures (68P05)

Related Items (12)

Proof systems for structured algebraic specifications: An overview ⋮ Specification and verification of object-oriented programs using supertype abstraction ⋮ Proof systems for structured specifications with observability operators ⋮ The behavior-realization adjunction and generalized homomorphic relations ⋮ 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 interpretation of Casl specifications ⋮ The Foundational Legacy of ASL ⋮ Non-deterministic data types: Models and implementations ⋮ Objects and classes in Algol-like languages ⋮ Two impossibility theorems on behaviour specification of abstract data types

This page was built for publication: Behavioural correctness of data representations