Implementing faceted classification for software reuse

Prieto-Díaz, Rubén

doi:10.1109/icse.1990.63636

Cited by 49 publications

(52 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In this case, local score calculations are simple, but they can apply to a large number of candidates. Component search and retrieval techniques [21], whose goal is to formulate a specific query and then retrieve all the components matching this query, provide adapted algorithms for this kind of local scores, for instance, keyword search or facet-based classification [22]. However, during detailed evaluation phase, there can be many complex criteria, each one concerning a specific property (signature matching, metric value comparison...).…”

Section: Limits Of These Approachesmentioning

confidence: 99%

A Component Selection Framework for COTS Libraries

George

Fleurquin

Sadou

2008

Component-Based Software Engineering

View full text Add to dashboard Cite

Abstract. Component-based software engineering proposes building complex applications from COTS (Commercial Off-The-Shelf) organized into component markets. Therefore, the main development effort is required in selection of the components that fit the specific needs of an application. In this article, we propose a mechanism allowing the automatic selection of a component among a set of candidate COTS, according to functional and non-functional properties. This mechanism has been validated on an example using the ComponentSource component market.

show abstract

Section: Limits Of These Approachesmentioning

confidence: 99%

A Component Selection Framework for COTS Libraries

George

Fleurquin

Sadou

2008

Component-Based Software Engineering

View full text Add to dashboard Cite

show abstract

“…[10,24]). The basic idea in most approaches was to identify components using keywords, possibly organised hierarchically, and then use indexes to find matching components, with a final round of manual checking to select the component that actually met the requirements.…”

Section: Reusable Componentsmentioning

confidence: 99%

An Introduction and History of Software Architectures, Components, and Reuse

Barroca¹,

Hall²,

Hall³

2000

Software Architectures

View full text Add to dashboard Cite

SummarySoftware components and architectures are gaining considerable support as the way to develop object-oriented systems and business applications. Current developments in component-based software reuse is taking place in the context of some thirty years of history. It is as well to rehearse that history, as we do in this chapter, and draw lessons from it, lest we repeat the errors of the past.This chapter fills in the background to the rest of the book. Concepts and ideas assumed in the other chapters will be explained and set in a context which will aid the reading and understanding of those chapters. The specialist reader already conversant with the field may wish to skip this chapter, though it is hoped that even for such a reader the orientation adopted here will be informative and helpful.

show abstract

“…or ODP), such as conceptual clarity, compactness and scalability (e.g. see [10]). A drawback, however, is the cost of avoiding invalid combinations, i.e.…”

Section: Introductionmentioning

confidence: 99%

“…A faceted taxonomy is a set of taxonomies, each describing a given domain from a different aspect, or facet (for more about faceted classification and analysis see [12,6,18,7,9,10,8]). Having a faceted taxonomy, the indexing of domain objects is done through conjunctive combinations of terms from the facets, called compound terms.…”

Section: Introductionmentioning

confidence: 99%

“…Having a faceted taxonomy, the indexing of domain objects is done through conjunctive combinations of terms from the facets, called compound terms. Faceted taxonomies are used in Web Catalogs [11], Libraries [8], Software Repositories [9,10], and several others application domains. Current interest in faceted taxonomies is also indicated by several recent or ongoing 4 Part of this work was done while the author was an ERCIM fellow at the VTT Technical Research Centre of Finland.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Compound Term Composition Algebra: The Semantics

Tzitzikas

Analyti

Spyratos

2005

Journal on Data Semantics II

View full text Add to dashboard Cite

Abstract. The Compound Term Composition Algebra (CTCA) is an algebra with four algebraic operators, whose composition can be used to specify the meaningful (valid) compound terms (conjunctions of terms) in a given faceted taxonomy in an efficient and flexible manner. The "positive" operations allow the derivation of valid compound terms through the declaration of a small set of valid compound terms. The "negative" operations allow the derivation of valid compound terms through the declaration of a small set of invalid compound terms. In this paper, we formally define the model-theoretic semantics of the operations and the closed-world assumptions adopted in each operation. We prove that CTCA is monotonic with respect to both valid and invalid compound terms, meaning that the valid and invalid compound terms of a subexpression are not invalidated by a larger expression. We show that CTCA cannot be directly represented in Description Logics. However, we show how we could design a metasystem on top of Description Logics in order to implement this algebra.

show abstract

Implementing faceted classification for software reuse

Cited by 49 publications

References 3 publications

A Component Selection Framework for COTS Libraries

A Component Selection Framework for COTS Libraries

An Introduction and History of Software Architectures, Components, and Reuse

Compound Term Composition Algebra: The Semantics

Contact Info

Product

Resources

About