Name
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. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1016/0304-3975(96)00068-0 | Theoretical Computer Science |
Keywords | DocType | Volume |
behavioural abstraction,behavioural satisfaction,higher-order logic,behavioral abstraction,higher order logic,first order logic | Journal | 167 |
Issue | ISSN | ISBN |
1 | Theoretical Computer Science | 3-540-59293-8 |
Citations | PageRank | References |
24 | 1.51 | 27 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martin Hofmann | 1 | 431 | 34.48 |
| Donald Sannella | 2 | 1417 | 134.34 |