Inductive behavioral proofs by unhiding

Research output: Contribution to journalConference articlepeer-review


We show that for any behavioral Σ-specification ß there is an ordinary algebraic specification ß̃ over a larger signature, such that a model behaviorally satisfies ß iff it satisfies, in the ordinary sense, the ∑-theorems of ß̃. 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, which takes a finite ß and produces a finite ß̃. The practical aspect of this procedure is that one can use any standard equational inductive theorem prover to derive behavioral theorems, even if neither equational reasoning nor induction is sound for behavioral satisfaction.

Original languageEnglish (US)
Pages (from-to)285-302
Number of pages18
JournalElectronic Notes in Theoretical Computer Science
Issue number1
StatePublished - Jul 2003
EventCMCS'03, Coalgebraic Methods in Computer Science Satellite Event for ETAPS 2003) - Warsaw, Poland
Duration: Apr 5 2003Apr 6 2003

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Inductive behavioral proofs by unhiding'. Together they form a unique fingerprint.

Cite this