Observer Complete Definitions are Behaviourally Coherent
暂无分享,去创建一个
We consider observational specifications of state-based systems which incorporate the declaration of a distinguished set of observer operations. These observers determine an indistinguishability relation for states which is called "observational equality". An important requirement for the non-observer operations is the compatibility with the observational equality. In the CafeOBJ language (and in extended hidden algebra) this property is called "behavioural coherence". In this presentation we introduce the notion of an "observer complete definition" and we show that any (non-observer) operation which is defined using this pattern is behaviourally coherent. We also discuss some consequences of this result for relating observational logic and extended hidden algebra semantics and for proving the correctness of observational implementations.
[1] Michel Bidoit. Proofs by Induction in "Fairly" Specified Equational Theories , 1982, GWAI.
[2] B. Jacobs,et al. A tutorial on (co)algebras and (co)induction , 1997 .
[3] Michel Bidoit,et al. Modular correctness proofs of behavioural implementations , 1998, Acta Informatica.
[4] Gérard P. Huet,et al. Proofs by Induction in Equational Theories with Constructors , 1980, FOCS.
[5] Peter Padawitz,et al. Swinging Data Types: Syntax, Semantics, and Theory , 1995, COMPASS/ADT.