On behavioural abstraction and behavioural satisfaction in higher-order logic

7Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Hofmann, M., & Sannella, D. (1995). On behavioural abstraction and behavioural satisfaction in higher-order logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 915, pp. 247–261). Springer Verlag. https://doi.org/10.1007/3-540-59293-8_199

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free