## Behavioral Abstraction is Information Hiding

### BibTeX

@MISC{Rosu_behavioralabstraction,

author = {Grigore Rosu},

title = {Behavioral Abstraction is Information Hiding},

year = {}

}

### OpenURL

### Abstract

We show that for any behavioral Sigma-specification B there is an ordinary algebraic specification ~ B over a larger signature, such that a model behaviorally satisfies B if and only if it satisfies ~ B, where is the information hiding operator exporting only the Sigma-theorems of ~ B. The idea is to add machinery for contexts and experiments (sorts, operations and equations), use it, and then hide it. We develop a procedure, called unhiding, that takes a finite B and produces a finite ~ B. The practical aspect of this procedure is that one can use any standard equational or inductive theorem prover to derive behavioral theorems, even if neither equational reasoning nor induction is sound for behavioral satisfaction.