The behavioural semantics of specifications with higher-order formulae as axioms is analyzed. A characterization of behavioural abstraction via behavioural satisfaction of formulae in which the equality symbol is interpreted as indistinguishability, due to Reichel and recently generalized to the case of first-order logic by Bidoit et al, is further generalized to this case. The fact that higher-order logic is powerful enough to express the indistinguishability relation is used to characterize behavioural satisfaction in terms of ordinary satisfaction, and to develop new methods for reasoning about specifications under behavioural semantics.
|Title of host publication||TAPSOFT '95: Theory and Practice of Software Development|
|Subtitle of host publication||6th International Joint Conference CAAP/FASE Aarhus, Denmark, May 22–26, 1995 Proceedings|
|Number of pages||15|
|Publication status||Published - 1995|
|Name||Lecture Notes in Computer Science|
|Publisher||Springer Berlin / Heidelberg|