Context induction: A proof principle for behavioural abstractions and algebraic implementations

@article{Hennicker1991ContextIA,
  title={Context induction: A proof principle for behavioural abstractions and algebraic implementations},
  author={Rolf Hennicker},
  journal={Formal Aspects of Computing},
  year={1991},
  volume={3},
  pages={326-345}
}
An induction principle, called context induction, is presented which is appropriate for the verification of behavioural properties of abstract data types. The usefulness of the proof principle is documented by several applications: the verification of behavioural theorems over a behavioural specification, the verification of behavioural implementations and the verification of “forget-restrict-identify” implementations. In particular, it is shown that behavioural implementations and “forget… CONTINUE READING

Topics from this paper.

Similar Papers

Loading similar papers…