## Situated Adaptive Software: Beyond the Object Paradigm (1995)

Venue: | In Proceedings, International Symposium on New Models of Software Architecture |

Citations: | 3 - 2 self |

### BibTeX

@INPROCEEDINGS{Goguen95situatedadaptive,

author = {Joseph A. Goguen and Grant Malcolm},

title = {Situated Adaptive Software: Beyond the Object Paradigm},

booktitle = {In Proceedings, International Symposium on New Models of Software Architecture},

year = {1995},

pages = {126--142}

}

### OpenURL

### Abstract

: This paper reviews our progress towards a new software paradigm extending the object paradigm, based on hidden order sorted algebra. Our goal is to produce software that is much more adaptable to context, and is also highly reliable and predictable. We find the logic of algebra, which is equational logic, especially convenient because of its simple and efficient mechanisation of reasoning. We show how equational specifications can describe objects, inheritance and modules, and support reasoning about them. Our treatment of modules emphasises the importance of reuse, and the role of the so-called Satisfaction Condition. We then show how to unify the object and logic paradigms by using logical variables that range over objects, and how to connect objects into concurrent systems, using a universal characterisation of parallel connection, and more generally, of parallel connection with synchronisation. We also discuss situated adaptive modules, which extend the power of paramet...

### Citations

476 |
Institutions: Abstract model theory for specification and programming
- Goguen, Burstall
- 1992
(Show Context)
Citation Context ...epresentations. The perhaps initially mysterious fact that mappings go in opposite directions for specifications and models is explained at a higher level of abstraction by the theory of institutions =-=[12]-=-, in which the maps on models and theories induced by a signature map go in opposite direction. Hence the duality between model based and theory based approaches is very natural. Finally, note that ou... |

122 |
Parameterized Programming
- Goguen
- 1984
(Show Context)
Citation Context ...el connection with synchronisation, illustrated by a simple example. The way this approach is based on logic means that it supports the powerful generic module facilities of paramaterised programming =-=[8, 9, 25]-=-. These facilities include generic modules that take other modules as parameters; furthermore, these other modules may themselves be parameterized. Moreover, module expressions allow combining the fun... |

85 | Logical support for modularisation
- Diaconescu, Goguen, et al.
- 1991
(Show Context)
Citation Context ...d on logic means that it supports the powerful module interconnection facilities of paramaterised programming [8, 9], since all that is required is a logical system that forms a so-called institution =-=[12, 4, 25]-=-. Facilities provided include generic modules that take other modules as parameters; furthermore, these other modules may themselves be parameterized. Moreover, module expressions allow combining the ... |

85 | Towards an algebraic semantics for the object paradigm - Goguen, Diaconescu - 1994 |

72 |
Types as theories
- Goguen
- 1991
(Show Context)
Citation Context ...paradigm by extending Horn clause logic with equality (as in [18, 19]) to hidden Horn clause logic with equality, building on prior work on hidden sorted logic as a foundation for the object paradigm =-=[10]-=-. We first study existential queries in a hidden equational setting, and then lift to hidden Horn clause logic. This provides a semantic foundation for FOOPlog [21], a multiparadigm language that supp... |

39 |
Order sorted algebra
- Goguen
- 1978
(Show Context)
Citation Context ...sion of many sorted algebra (hereafter, `MSA'), and describes the order sorted version of hidden sorted algebra. 3.1 Order sorted algebra A major motivation of the first paper on order sorted algebra =-=[7]-=- was to enable a reasonable treatment of errors in abstract data types ([24] discusses difficulties with handling errors in MSA); another motivation is that subsorts can greatly speed up certain theor... |

36 | CAT: a system for the structured elaboration of correct programs from structured specifications - Goguen, Burstall |

31 |
and R*azvan Diaconescu. An Oxford survey of order sorted algebra
- Goguen
- 1994
(Show Context)
Citation Context ... interpreted as inclusion among the corresponding carriers; all approaches to OSA share this essential idea. Starting around 1983, Goguen and Meseguer refined the approach in [7], and the approach of =-=[13]-=- is still more general. Both OSA and MSA are based on the notion of S-sorted sets, but whereas in MSA S is a set, in OSA S is a partially ordered set. If S is a set of sort names, the partial order in... |

22 | Formal methods and social context in software development - Goguen, Luqi - 1995 |

21 | Hyperprogramming: A formal approach to software environments
- Goguen
- 1990
(Show Context)
Citation Context ...el connection with synchronisation, illustrated by a simple example. The way this approach is based on logic means that it supports the powerful generic module facilities of paramaterised programming =-=[8, 9, 25]-=-. These facilities include generic modules that take other modules as parameters; furthermore, these other modules may themselves be parameterized. Moreover, module expressions allow combining the fun... |

17 |
Programming with Modules as Typed Functional Programming,” procs
- Burstall
- 1985
(Show Context)
Citation Context ...nctionality of two or more modules, while taking proper account of their parameterization and of any modules that they may inherit. There is an analogy with functional programming that may be helpful =-=[1]-=-: we can consider modules to be like functions, with theories as their types; then evaluating a well-typed module expression results in a new module, just as evaluating a well-typed functional express... |

17 |
The logic of Horn clauses is equational
- Diaconescu
- 1993
(Show Context)
Citation Context ...n extend to Horn clause logic with equality, by applying a construction that reduces that logic to hidden sorted equational logic. This is described in [16], extending some earlier work of Diaconescu =-=[3]-=-. 6 Concurrency Concurrency is now considered an essential aspect of the object paradigm. Perhaps surprisingly, there is an elegant purely algebraic treatment of concurrency, based on hidden sorted al... |

6 |
Context induction: an exercise
- Gaudel, Privara
- 1991
(Show Context)
Citation Context ...equence is defined in terms of contexts, and Henniker's proof technique is based on induction over the size of contexts. Such induction proofs are often surprisingly complicated (cf. the statement in =-=[6]-=- that `putting context induction into practise was less straightforward than expected'), so we seek both to extend Henniker's results to the order sorted case, and to simplify the inductive proofs. A ... |

3 |
The formal completeness of Equational Logics
- Diaconescu
- 1991
(Show Context)
Citation Context ...h that for any other \Sigma-algebra A that is monotonic except on \Omega\Gamma there is a unique \Sigma-homomorphism P \Sigma;\Omega ! A. 2 Some recent work of Diaconescu on "formal equational lo=-=gic" [5]-=- provides a more abstract approach to minimising restrictions on OSA signatures, in the following way: An order sorted signature (S; ; \Sigma) determines an adjunction between the category Set S of S-... |