Copyright © 1996 Published by Elsevier Science B.V.
On behavioural abstraction and behavioural satisfaction in higher-order logic*1
Available online 11 June 1999.
Abstract
The behavioural semantics of specifications with higher-order logical formulae as axioms is analyzed. A characterization of behavioural abstraction via behavioural satisfaction of formulae in which the equality symbol is interpreted as indistinguishability, which is due to Reichel and was 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.
Article Outline
*1 A condensed version of this paper appeared in: Proc. 20th Colloq. on Trees in Algebra and Programming, Internat. Joint Conf. on Theory and Practice of Software Development (TAPSOFT), Aarhus. Lecture Notes in Computer Science, Vol. 915 (Springer, Berlin, 1995).
1 Supported by a Human Capital and Mobility fellowship, contract number ERBCHBICT930420.
2 Supported by an EPSRC Advanced Fellowship and EPSRC grants GR/H73103 and GR/J07303.






E-mail Article
Add to my Quick Links

Cited By in Scopus (9)







