Results 1 
5 of
5
Composing Hidden Information Modules over Inclusive Institutions
 In From ObjectOrientation to Formal Methods: Essays in Honor of JohanOle Dahl
, 2003
"... This paper studies the composition of modules that can hide information, over a very general class of logical systems called inclusive institutions. Two semantics are given for composition of such modules using five familiar operations, and a property called conservativity is shown necessary and suf ..."
Abstract

Cited by 18 (3 self)
 Add to MetaCart
This paper studies the composition of modules that can hide information, over a very general class of logical systems called inclusive institutions. Two semantics are given for composition of such modules using five familiar operations, and a property called conservativity is shown necessary and sufficient for these semantics to agree. The first semantics extracts the visible properties of the result of composing the visible and hidden parts of modules, while the second uses only the visible properties of the components; the semantics agree when the visible consequences of hidden information are enough to determine the result of the composition. A number of "laws of software composition" are proved relating the composition operations. Inclusive institutions simplify many proofs.
Kan Extensions of Institutions
"... GB92] to formally capture the notion of logical system. Interpreting institutions as functors, and morphisms and representations of institutions as natural transformations, we give elegant proofs for the completeness of the categories of institutions with morphisms and representations, respectively, ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
GB92] to formally capture the notion of logical system. Interpreting institutions as functors, and morphisms and representations of institutions as natural transformations, we give elegant proofs for the completeness of the categories of institutions with morphisms and representations, respectively, show that the duality between morphisms and representations of institutions comes from an adjointness between categories of functors, and prove the cocompleteness of the categories of institutions over small signatures with morphisms and representations, respectively. Category: F.3, F.4
Behavioral Abstraction is Information Hiding
"... We show that for any behavioral Sigmaspecification 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 Sigmatheorems of ~ B. The idea is t ..."
Abstract
 Add to MetaCart
We show that for any behavioral Sigmaspecification 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 Sigmatheorems 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.
A Foundational Approach to Modularization (Extended Abstract)
"... This paper introduces the novel concept of inclusive institution as a foundational framework for studying logicindependent module compositionality, defines specification modules as specifications allowing both public and private signatures, and shows that an internal property of modules, called con ..."
Abstract
 Add to MetaCart
This paper introduces the novel concept of inclusive institution as a foundational framework for studying logicindependent module compositionality, defines specification modules as specifications allowing both public and private signatures, and shows that an internal property of modules, called conservatism, is crucial for compositional semantics.
Composition of Modules with Hidden Information over Inclusive Institutions
"... This paper studies the composition of modules that can hide information, over a very general class of logical systems called inclusive institutions. Two semantics are given for compositions using five familiar operations, and a property called conservativity is shown necessary and sufficient for the ..."
Abstract
 Add to MetaCart
This paper studies the composition of modules that can hide information, over a very general class of logical systems called inclusive institutions. Two semantics are given for compositions using five familiar operations, and a property called conservativity is shown necessary and sufficient for these semantics to agree. The first semantics extracts the visible properties of the result of composing both the visible and hidden parts of modules, while the second uses only the visible properties of the components. Several "laws of software composition" are given, which demonstrate the power of inclusive institutions to simplify proofs.