Acta Informatica

, Volume 35, Issue 11, pp 951–1005 | Cite as

Modular correctness proofs of behavioural implementations

  • Michel Bidoit
  • Rolf Hennicker


We introduce a concept of behavioural implementation for algebraic specifications which is based on an indistinguishability relation (called behavioural equality). The central objective of this work is the investigation of proof rules which allow us to establish the correctness of behavioural implementations in a modular (and stepwise) way and, moreover, are practicable enough to induce proof obligations that can be discharged with existing theorem provers. Under certain conditions our proof technique can also be applied for proving the correctness of implementations based on an abstraction equivalence between algebras in the sense of Sannella and Tarlecki. The whole approach is presented in the framework of total algebras and first-order logic with equality.


Theorem Prover Central Objective Indistinguishability Relation Proof Technique Proof Obligation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Michel Bidoit
    • 1
  • Rolf Hennicker
    • 2
  1. 1. Laboratoire Specification et Verification, CNRS & Ecole Normale Supérieure de Cachan 61, Avenue du President Wilson, F-94235 Cachan Cedex, France FR
  2. 2. Institut für Informatik, Ludwig-Maximilians-Universität München, Oettingenstra{ß}e 67, D-80538 München, Germany DE

Personalised recommendations