Loading...
Please wait, while we are loading the content...
Similar Documents
Class-graph Inference for Adaptive Programs (1997)
| Content Provider | CiteSeerX |
|---|---|
| Author | Palsberg, Jens |
| Abstract | Software generators can adapt components to changes in the architectures in which the components operate. The idea is to keep the architecture description separate and let the software generator mix it with specifications of each component. Adaptation is done by regeneration: when the architecture changes, the components are regenerated. A software component will usually be written with a particular architecture in mind. This raises the question: how much has it committed to the particular structure of that architecture? To put it in a nutshell: How flexible is a given software component? In this paper we study this question in the setting of Lieberherr’s adaptive programming. Lieberherr uses class graphs as the architecture and so-called adaptive programs as the software components. We present a polynomial-time class-graph inference algorithm for adaptive programs. The algorithm builds a representation of the set of class graphs with which a given adaptive program can |
| File Format | |
| Journal | Neth J Physiol |
| Publisher Date | 1997-01-01 |
| Access Restriction | Open |
| Subject Keyword | Particular Structure Software Component Particular Architecture Architecture Change Adaptive Programming Polynomial-time Class-graph Inference Algorithm Object System Adaptive Program Class Graph Software Generator So-called Adaptive Program Class-graph Inference Architecture Description |
| Content Type | Text |
| Resource Type | Article |
