Selecting reusable components using algebraic specifications

A significant hurdle confronts the software reuser attempting to select candidate components from a software repository - discriminating between those components without resorting to inspection of the implementation(s). We outline a mixed classification/axiomatic approach to this problem based upon our lattice-based faceted classification technique and Guttag and Horning's algebraic specification techniques. This approach selects candidates by natural language-derived classification, by their interfaces, using signatures, and by their behavior, using axioms. We briefly outline our problem domain and related work. Lattice-based faceted classifications are described; the reader is referred to surveys of the extensive literature for algebraic specification techniques. Behavioral support for reuse queries is presented, followed by the conclusions

A hybrid approach to software repository retrieval: Blending faceted classification and type signatures

We present a user interface for software reuse repository that relies both on the informal semantics of faceted classification and the formal semantics of type signatures for abstract data types. The result is an interface providing both structural and qualitative feedback to a software reuser

Hadron properties from QCD bound-state equations: A status report

Employing an approach based on the Green functions of Landau-gauge QCD, some selected results from a calculation of meson and baryon properties are presented. A rainbow-ladder truncation to the quark Dyson-Schwinger equation is used to arrive at a unified description of mesons and baryons by solving Bethe-Salpeter and covariant Faddeev equations, respectively.Comment: 6 pages, 4 figures; Plenary talk given at the 5-th Int. Conf. on Quarks and Nuclear Physics, Beijing, September 21-26,200

Neural network-based retrieval from software reuse repositories

A significant hurdle confronts the software reuser attempting to select candidate components from a software repository - discriminating between those components without resorting to inspection of the implementation(s). We outline an approach to this problem based upon neural networks which avoids requiring the repository administrators to define a conceptual closeness graph for the classification vocabulary

Design of a lattice-based faceted classification system

We describe a software reuse architecture supporting component retrieval by facet classes. The facets are organized into a lattice of facet sets and facet n-tuples. The query mechanism supports precise retrieval and flexible browsing

Balancing generality and specificity in component-based reuse

For a component industry to be successful, we must move beyond the current techniques of black box reuse and genericity to a more flexible framework supporting customization of components as well as instantiation and composition of components. Customization of components strikes a balanced between creating dozens of variations of a base component and requiring the overhead of unnecessary features of an 'everything but the kitchen sink' component. We argue that design and instantiation of reusable components have competing criteria - design-for-use strives for generality, design-with-reuse strives for specificity - and that providing mechanisms for each can be complementary rather than antagonistic. In particular, we demonstrate how program slicing techniques can be applied to customization of reusable components

Inheritance for software reuse: The good, the bad, and the ugly

Inheritance is a powerful mechanism supported by object-oriented programming languages to facilitate modifications and extensions of reusable software components. This paper presents a taxonomy of the various purposes for which an inheritance mechanism can be used. While some uses of inheritance significantly enhance software reuse, some others are not as useful and in fact, may even be detrimental to reuse. The paper discusses several examples, and argues for a programming language design that is selective in its support for inheritance

Covariant solution of the three-quark problem in quantum field theory: the nucleon

We provide details on a recent solution of the nucleon's covariant Faddeev equation in an explicit three-quark approach. The full Poincare-covariant structure of the three-quark amplitude is implemented through an orthogonal basis obtained from a partial-wave decomposition. We employ a rainbow-ladder gluon exchange kernel which allows for a comparison with meson Bethe-Salpeter and baryon quark-diquark studies. We describe the construction of the three-quark amplitude in full detail and compare it to a notation widespread in recent publications. Finally, we discuss first numerical results for the nucleon's amplitude.Comment: 10 pages, 4 figures, 4 tables; Contributed to the 19th International IUPAP Conference on Few-Body Problems in Physics, Bonn, Germany, August 31 - September 5, 200