Behavioral Abstraction is Hiding Information Export

@misc{citeulike:1265678, abstract = {We show that for any behavioral \#-specification B there is an ordinary algebraic specification B over a larger signature, such that a model behaviorally satisfies B i\# it satisfies, in the ordinary sense, the \#-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, which takes a finite B and produces a finite B. The practical aspect of this procedure is that one can...}, author = {Rosu, Grigore}, citeulike-article-id = {1265678}, citeulike-linkout-0 = {http://citeseer.ist.psu.edu/rosu04behavioral.html}, citeulike-linkout-1 = {http://citeseer.lcs.mit.edu/rosu04behavioral.html}, citeulike-linkout-2 = {http://citeseer.ifi.unizh.ch/rosu04behavioral.html}, citeulike-linkout-3 = {http://citeseer.comp.nus.edu.sg/rosu04behavioral.html}, keywords = {abstraction, behavior}, posted-at = {2007-04-29 14:51:51}, priority = {2}, title = {Behavioral Abstraction is Hiding Information}, url = {http://citeseer.ist.psu.edu/rosu04behavioral.html} }

TY - GEN ID - citeulike:1265678 L3 - citeulike-article-id:1265678 N2 - We show that for any behavioral #-specification B there is an ordinary algebraic specification B over a larger signature, such that a model behaviorally satisfies B i# it satisfies, in the ordinary sense, the #-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, which takes a finite B and produces a finite B. The practical aspect of this procedure is that one can... TI - Behavioral Abstraction is Hiding Information KW - abstraction KW - behavior AU - Rosu, Grigore UR - http://citeseer.ist.psu.edu/rosu04behavioral.html ER -