On behavioural abstraction and behavioural satisfaction in higher-order logic

  • Martin Hofmann
  • Donald Sannella
CAAP Caap-3: Logic & Specification
Part of the Lecture Notes in Computer Science book series (LNCS, volume 915)


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.


  1. [BH94]
    M. Bidoit and R. Hennicker. Proving behavioural theorems with standard first-order logic. Proc. 4th Intl. Conf. on Algebraic and Logic Programming, Madrid. Springer LNCS 850 (1994).Google Scholar
  2. [BH95]
    M. Bidoit and R. Hennicker. Behavioural theories. Selected Papers from the 10th Workshop on Specification of Abstract Data Types, Santa Margherita Ligure. Springer LNCS, to appear (1995).Google Scholar
  3. [BHW94]
    M. Bidoit, R. Hennicker and M. Wirsing. Behavioural and abstractor specifications. Report LIENS-94-10, Ecole Normale Supérieure (1994). To appear in Science of Computer Programming. A short version appeared as: Characterizing behavioural semantics and abstractor semantics. Proc. 5th European Symp. on Programming, Edinburgh. Springer LNCS 788, 105–119 (1994).Google Scholar
  4. [Far92]
    J. Farrés-Casals. Verification in ASL and Related Specification Languages. Ph.D. thesis, Report CSR-92-92, Univ. of Edinburgh (1992).Google Scholar
  5. [GM82]
    J. Goguen and J. Meseguer. Universal realization, persistent interconnection and implementation of abstract modules. Proc. 9th Intl. Colloq. on Automata, Languages and Programming, Aarhus. Springer LNCS 140, 265–281 (1982).Google Scholar
  6. [HS95]
    M. Hofmann and D. Sannella. On behavioural abstraction and behavioural satisfaction in higher-order logic. Report ECS-LFCS-95-318, Univ. of Edinburgh (1995). Available on WWW in http://www.dcs.ed.ac.uk/lfcsreps/EXPORT/95/ECS-LFCS-95-318.Google Scholar
  7. [KST94]
    S. Kahrs, D. Sannella and A. Tarlecki. The semantics of Extended ML: a gentle introduction. Proc. Intl. Workshop on Semantics of Specification Languages, Utrecht, 1993. Springer Workshops in Computing, 186–215 (1994).Google Scholar
  8. [MG85]
    J. Meseguer and J. Goguen. Initiality, induction and computability. In: Algebraic Methods in Semantics (M. Nivat and J. Reynolds, eds.). Cambridge Univ. Press, 459–540 (1985).Google Scholar
  9. [Nip88]
    T. Nipkow. Observing nondeterministic data types. Selected Papers from the 5th Workshop on Specification of Abstract Data Types, Gullane. Springer LNCS 332, 170–183 (1988).Google Scholar
  10. [NO88]
    P. Nivela and F. Orejas. Initial behaviour semantics for algebraic specifications. Selected Papers from the 5th Workshop on Specification of Abstract Data Types, Gullane. Springer LNCS 332, 184–207 (1988).Google Scholar
  11. [Rei85]
    H. Reichel. Behavioural validity of conditional equations in abstract data types. Proc. of the Vienna Conf. on Contributions to General Algebra, 1984. Teubner-Verlag, 301–324 (1985).Google Scholar
  12. [ST87]
    D. Sannella and A. Tarlecki. On observational equivalence and algebraic specification. Journal of Computer and System Sciences 34:150–178 (1987).Google Scholar
  13. [SW83]
    D. Sannella and M. Wirsing. A kernel language for algebraic specification and implementation. Proc. 1983 Intl. Conf. on Foundations of Computation Theory, Borgholm. Springer LNCS 158, 413–427 (1983).Google Scholar
  14. [Sch92]
    O. Schoett. Two impossibility theorems on behavioural specification of abstract data types. Acta Informatica 29:595–621 (1992).Google Scholar
  15. [Sch94]
    P.-Y. Schobbens. Second-order proof systems for algebraic specification languages. Selected Papers from the 9th Workshop on Specification of Abstract Data Types, Caldes de Malavella. Springer LNCS 785, 321–336 (1994).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Martin Hofmann
    • 1
  • Donald Sannella
    • 1
  1. 1.Laboratory for Foundations of Computer ScienceUniversity of EdinburghEdinburghUK

Personalised recommendations