Results 1  10
of
10
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 23 (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.
A Survey of Formal Software Development Methods
 SOFTWARE ENGINEERING
, 1988
"... This paper is a survey of the current state of the art of research on methods for formal software development. The scope of this paper is necessarily restricted so as to avoid discussion of a great many approaches at a very superficial level. First, although some of the ideas discussed below could b ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
This paper is a survey of the current state of the art of research on methods for formal software development. The scope of this paper is necessarily restricted so as to avoid discussion of a great many approaches at a very superficial level. First, although some of the ideas discussed below could be (and have been) applied to hardware development as well as to software development, this topic will not be treated here. Second, the special problems involved in the development of concurrent systems will not be discussed here although again many of the approaches mentioned below could be applied in this context. Third, no attempt is made to treat programming methodologies such as Jackson's method and program development systems such as the MIT Programmer's Apprentice which are not formally based. Finally, this survey does not claim to be fully exhaustive although an attempt has been made to cover most of the main approaches. Many of the technical details of the different approaches discussed have been glossed over or simplified for the purposes of this presentation; full details may be found in the cited references.
Formal Transformations from GraphicallyBased ObjectOriented Representations to TheoryBased Specifications
, 1996
"... Approved for public release; distribution unlimited The views expressed in this dissertation are those of the author and do not re
ect the ocial policy or position of the Department of Defense or the U. S. Government. AFIT/DS/ENG/9605 ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
(Show Context)
Approved for public release; distribution unlimited The views expressed in this dissertation are those of the author and do not re
ect the ocial policy or position of the Department of Defense or the U. S. Government. AFIT/DS/ENG/9605
Presheaves as Configured Specifications
"... The paper addresses a notion of configuring systems, constructing them from specified component parts with specified sharing. This notion is independent of any underlying specification language and has been abstractly identified with the taking of colimits in category theory. Mathematically it is kn ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The paper addresses a notion of configuring systems, constructing them from specified component parts with specified sharing. This notion is independent of any underlying specification language and has been abstractly identified with the taking of colimits in category theory. Mathematically it is known that these can be expressed by presheaves and the present paper applies this idea to configuration. We interpret the category theory informally as follows. Suppose C is a category whose objects are interpreted as specifications, and for which each morphism u : X ! Y is interpreted as contravariant "instance reduction", reducing instances of specification Y to instances of X . Then a presheaf P : Set C op represents a collection of instances that is closed under reduction. We develop an algebraic account of presheaves in which we present configurations by generators (for components) and relations (for shared reducts), and we outline a proposed configuration language based on the techniques. Oriat uses diagrams to express colimits of specifications, and we show that Oriat's category Diag(C) of finite diagrams is equivalent to the category of finitely presented presheaves over C.
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

Cited by 1 (0 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 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.
Putting Synchronous and Asynchronous Object Modules together: an EventBased Model for Concurrent Composition
, 1997
"... In this paper we show how by means of a categorical framework we can compose systems of concurrent object modules satisfying some interaction rules given by a specification. Module interaction can be either synchronous or asynchronous and both cases are considered separately. The behaviour of object ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this paper we show how by means of a categorical framework we can compose systems of concurrent object modules satisfying some interaction rules given by a specification. Module interaction can be either synchronous or asynchronous and both cases are considered separately. The behaviour of object modules is modelled by labelled prime event structures. The category of labelled prime event structures has (co)products. A product in the category of labelled prime event structures is given accordingly to Winskel and Nielsen but denotes parallel composition in a sense that does not have much practical interest. For synchronously communicating modules, by applying to the product a restriction on the allowed life cycles by means of the categorical concept of a functor induced by a co bration and a morphism on labels, we achieve the desired joint behaviour. A way to model asynchronous composition of modules is to construct a coproduct and extend it by their interaction rules. At the end of ...
M.: Perspective Switching Using Theories and Interpretations
 Intelligent Systems: A Semiotic Perspective, NIST, Gaithesburg, MD
, 1996
"... ..."
(Show Context)
Morphisms and Semantics for Higher Order Parameterized Programming
, 2002
"... Parameterized programming is extended to higher order modules, by extending views, which fit actual parameters to formal parameters in a flexible way, to morphisms, with higher order module expressions to compose modules into systems. A category theoretic semantics is outlined, and examples in BOBJ ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Parameterized programming is extended to higher order modules, by extending views, which fit actual parameters to formal parameters in a flexible way, to morphisms, with higher order module expressions to compose modules into systems. A category theoretic semantics is outlined, and examples in BOBJ show the power of morphisms.
Categorybased Semantics for Equational and Constraint Logic Programming
, 1994
"... This thesis proposes a general framework for equational logic programming, called categorybased equational logic by placing the general principles underlying the design of the proform. This framework generalises equational deduction to an arbitrary category satisfying certain natural conditions; ..."
Abstract
 Add to MetaCart
(Show Context)
This thesis proposes a general framework for equational logic programming, called categorybased equational logic by placing the general principles underlying the design of the proform. This framework generalises equational deduction to an arbitrary category satisfying certain natural conditions; completeness is proved under a hypothesis of quantier projectivity, using a semantic treatment that regards quantiers as models rather than variables, and regards valuations as model morphisms rather than functions. This is used as a basis for a model theoretic categorybased approach to a paramodulationbased operational semantics for equational logic programming languages. Categorybased equational logic in conjunction with the theory of institutions is used to give mathematical foundations for modularisation in equational logic programming. We study the soundness and completeness problem for module imports in the context of a categorybased semantics for solutions to equational logic programming queries. Constraint logic programming is integrated into the equational logic programming
Model{Theoretic Foundations
"... Abstract: This paper presents in an informal way the main ideas underlying our work on the modeltheoretic foundations of algebraic specication and program development. We attempt to oer an overall view, rather than new results, and focus on the basic motivation behind the technicalities presented e ..."
Abstract
 Add to MetaCart
Abstract: This paper presents in an informal way the main ideas underlying our work on the modeltheoretic foundations of algebraic specication and program development. We attempt to oer an overall view, rather than new results, and focus on the basic motivation behind the technicalities presented elsewhere and on the conclusions from this work.