| Beat Liver and Dean T. Allemang. A Functional Representation for Software Reuse and Design. Software Engineering and Knowledge Engineering, in press, 1995. Special Issue on Evolutionary Approaches to Software Engineering. 5 |
....addresses issues of cognitive modeling (since it is based on an analysis of a human problem solving protocol) ToRQUE provides a cognitive theory of exploratory scientific reasoning processes; the work proposed here could potentially provide an account of the evolution of these processes. ZD: ZD [Liver Allemang, 1985, Allemang, 1997] is a functional representation for describing computational systems (as is TMK) ZD has largely been used for analysis of systems, particularly with regards to viability of configurations of components. Consequently, it is particularly strong in providing formal structures and ....
Liver, B. & Allemang, D. T. (1985). A functional representation for software reuse and design. International Journal of Software Engineering and Knowledge Engineering, 5(2), 227--269.
....are composed to form larger structures, one must explicitly describe the bridge between them. ffl The context interface through which external forces can act on a given artifact is explicitly defined. Earlier FR work has even been applied to software for diagnostic and explanation purposes [18, 19]. To date, this has been at the programming in the small level of individual statements and their interactions, while ACTI addresses programming in the large issues of subsystem meaning and composition. The similarities between ACTI and FR, two efforts that were arrived at independently, ....
B. Liver and D. T. Allemang, "A functional representation for software reuse and design," International Journal of Software Engineering and Knowledge Engineering, vol. 5, pp. 227--269, 1995. 11
....as Functional Representation (FR) for a review of this work, see [5] for specifying such interactions. We build on the work on requirements specification and task modeling using functional ideas reported in [6] In a recent paper on applying functional representation to software reuse and design [7], requirements of some specified functional prototype from other functional prototypes are specified in its implementation. In contrast, we describe requirements of some user for a complete system to be built. The outline of our argument in this paper is as follows. We discuss some desiderata for ....
Liver, B., and Allemang, D. T. "A Functional Representation for Software Reuse and Design, International Journal of Software Engineering and Knowledge Engineering, vol. 5, pp. 227-269, 1995.
....a single domainrelation. In general, we might want to define postconditions involving complex logical combinations of domain relations. For example, we might want to assert that a task produces a time slot which is consistent with a schedule, if and only if such a slot exists. Consider, ZD (Liver and Allemang, 1985; Allemang, 1997) a functionally oriented language for modeling software architectures. ZD uses predicate calculus to combine assertions about values to define the preconditions and postconditions of computational elements. Using such combinations, ZD is able to deduce complex properties of the ....
Liver, B. and Allemang, D. T. (1985). A functional representation for software reuse and design. International Journal of Software Engineering and Knowledge Engineering, 5(2):227--269.
....30332 0280 murdock cc.gatech.edu April 16, 1998 Technical Report GIT CC 98 13 Abstract How do we build computational models of computation itself This paper analyzes two such modeling languages from the perspective of building a third language which integrates their advantages. The ZD language [Liver Allemang, 1985, Allemang, 1997] models software components and configurations in support of verification and reuse. The TMK language [Stroulia, 1994, Goel et al. 1996, Griffith, 1997] models intelligent systems in support of failuredriven learning and other reasoning tasks. I claim that these objectives are ....
....system to one which already has the data or redesignating the data to some data which is already on the system. All of the examples in ZD seem to have this property, i.e. that the terms remained fixed while the predicates change. However, other work on ZD seems to suggest the opposite conclusion. [Liver Allemang, 1985] presents an example of a stack in which a transition occurs from S.top = X to S.top = X 1. Clearly the intent here is that S.top has changed, not the definition of equality. It may be that this issue simply does not need to be fully resolved for the kinds of tasks that ZD is intended to address; ....
[Article contains additional citation context not shown here]
Liver, B. & Allemang, D. T. (1985). A functional representation for software reuse and design. International Journal of Software Engineering and Knowledge Engineering, 5(2), 227--269.
....industry based on reusable, local certifiable modules. In our current work we are resolving a number of the details of the ZD formalism to specify how the connections between requirements and specifications can be formalized, and under exactly what circumstances a proviso must be propagated [5]. Our goal is to implement ZD in such a way that the proviso propagation algorithm from Dudu can be rebuilt, along with support for configuration of the form shown in figure 2. Further applications include modeling of distributed systems [3] and fault isolation [4] ZD will then become a language ....
Beat Liver and Dean T. Allemang. A Functional Representation for Software Reuse and Design. Software Engineering and Knowledge Engineering, in press, 1995. Special Issue on Evolutionary Approaches to Software Engineering. 5
....Dean Allemang comes to software reuse from the Knowledge Based Software Engineering community. He completed his dissertation on Functional Representation of Software [1] which extended the approach to software understanding pioneered by Lewis Johnson s PROUST. Development has continued on ZD [2, 3], a language for expressing functional representations of software. This work has led to a current project (Familiar) funded under the DARPA Evolutionary Design of Complex Systems programme to apply functional representation to capture and recording of design rationale. Familiar combines the ....
B. Liver and D. Allemang, "A functional representation for software reuse and design," Software engineering and Knowledge Engineering, vol. 2, pp. 227--269, June 1995. Special Issue on Evolutionary Approaches to Software Engineering. Allemang- 5
....TELECOM PTT plans to accomplish more (and develop a more extensive framework) by sharing software components that are reuseable. A component oriented formal representation of software function for design and network management tasks (e.g. diagnosis and configuration) is under development [36] [37]. This framework provides mechanism for correctly and efficiently combining (independently developed) functional components. ETHZ TIK work: The computer Engineering and Networks Laboratory (TIK) is presently engaged in three advanced multimedia and CSCW research projects: ffl In the context of ....
B. Liver and D. Allemang, "A functional representation for software reuse and design," Journal on Software Engineering and Knowledge Engineering, 1995.
....software specification approaches (Resolve [ Hollingsworth, 1992 ] Larch shared language [ Guttag and Horning, 1993 ] In this paper, the formal properties of SDLs are not studied, because they are independent of ZD itself. A more detailed discussion of SDLs is given in [ Allemang, 1990; Liver and Allemang, 1995 ] The main reason for the separation between the additional result and output state is that they might be described by different SDLs. In our example, the concept empty( is defined by the function move, i.e. a variable is empty if its value is moved to some other location. This function is ....
....that are indestructible values. The function move is a reusable representation of this intention, rather than any particular program code. Therefore, it is possible to represent in ZD information that is usually represented in documentation, wishful variable names, or not at all [ Allemang, 1990; Liver and Allemang, 1995 ] A function implementation defines how its function specification is achieved by a combination of other functions. This description takes the form of a statetransition graph, where the states are partial state descriptions. A transition is labeled with the function that achieves this ....
[Article contains additional citation context not shown here]
Beat Liver and Dean T. Allemang. A functional representation for software reuse and design. Software Engineering and Knowledge Engineering, Special Issue on Evolutionary Approaches to Software Engineering, 1995. in press.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC