Browsing a Component Library Using Non-functional Information

  • Xavier Franch
  • Josep Pinyol
  • Joan Vancells
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1622)


This paper highlights the role of non-functional information when reusing from a component library. We describe a method for selecting appropriate implementations of Ada packages taking non-functional constraints into account; these constraints model the context of reuse. Constraints take the form of queries using an interface description language called NoFun, which is also used to state non-functional information in Ada packages; query results are trees of implementations, following the import relationships between components. We define two different situations when reusing components, depending whether we take the library being searched as closed or extendible. The resulting tree of implementations can be manipulated by the user to solve ambiguities, to state default behaviours, and by the like. As part of the proposal, we face the problem of computing from code the non-functional information that determines the selection process.


Selection Tree Priority Queue Conjunctive Normal Form Adjacency List Dijkstra Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Mili, H.; Mili, F.; Mili, A.: Reusing Software: Issues and Research Directions. IEEE Transactions on Software Engineering 21, 6. IEEE Computer Society (1995)CrossRefGoogle Scholar
  2. 2.
    Franch, X.: Including Non-Functional Issues in Anna/Ada Programs for Automatic Implementation Selection. Proceedings of Ada Europe 97 (London, UK). Lecture Notes in Computer Science, Vol. 1251. Springer-Verlag, Berlin Heidelberg New York (1997)Google Scholar
  3. 3.
    Franch, X.: Systematic Formulation of Non-Functional Characteristics of Software. Proceedings of International Conference on Requirements Engineering (ICRE) (Colorado Springs, USA). IEEE Computer Society (1997)Google Scholar
  4. 4.
    Brassard, G.: Crusade for a better Notation. SIGACT News, 16, 4 (1985)Google Scholar
  5. 5.
    Prieto-Díaz, R.: Classifying Software for Reusability. IEEE Software 4, 1. IEEE Computer Society (1987)CrossRefGoogle Scholar
  6. 6.
    Boisvert, R.F.: A Web Gateway to a Virtual Mathematical Software Repository. Proceedings of 2nd International WWW Conference, Chicago (Illinois, U.S.A.) (1994)Google Scholar
  7. 7.
    Poulin, J.S.; Werkman, K.J.: Melding Structured Abstracts and the WWW for Retrieval of Reusable Components. Proceedings of Symposium on Software Reusability (Seattle, U.S.A.) (1995)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Xavier Franch
    • 1
  • Josep Pinyol
    • 2
  • Joan Vancells
    • 2
  1. 1.Universitat Politècnica de Catalunya (UPC)Barcelona, CatalunyaSpain
  2. 2.Universitat de Vic (Barcelona)CatalunyaSpain

Personalised recommendations