3008627 GI 88 Cover:3008627 GI 88 Cover
نویسندگان
چکیده
Feature modeling is an important approach to dealing with variability at an abstract level in a hierarchical manner extensively used in software product lines. For its use in conjunction with other UML models and MDA approach, it is important to correctly integrate feature modeling into UML. In this paper, we present an approach to integrating feature modeling into UML that respects abstractness of feature modeling elements. This is achieved by deriving feature modeling elements from the deeper levels of the UML metamodel. We applied this approach to the essential elements of feature modeling in the cardinality-based Czarnecki-Eisenecker notation and selected elements specific to other notations. Since UML modeling tools do not support such modifications of the UML metatmodel, in order to facilitate experimentation with combining elements from different notations, we implemented this feature modeling extension as a UML profile (in Enterprise Architect and Omondo UML).
منابع مشابه
3008627 GI 88 Cover:3008627 GI 88 Cover
Next generation middleware must support applications in the face of increasing diversity in interaction paradigms, end system types and network styles. Therefore, to secure applications, security policies must be configured and indeed reconfigured at runtime. In this paper, we propose an approach combining the openness of reflective middleware with the flexibility of programmable security to me...
متن کاملGreen Infrastructure Design for Stormwater Runoff and Water Quality: Empirical Evidence from Large Watershed-Scale Community Developments
Green infrastructure (GI) design is advocated as a new paradigm for stormwater management, whereas current knowledge of GI design is mostly based on isolated design strategies used at small-scale sites. This study presents empirical findings from two watershed-scale community projects (89.4 km and 55.7 km) in suburban Houston, Texas. The GI development integrates a suite of on-site, infiltratio...
متن کاملBounds for the Clique Cover Width of Factors of the Apex Graph of the Planar Grid
The clique cover width of G, denoted by ccw(G), is the minimum value of the bandwidth of all graphs that are obtained by contracting the cliques in a clique cover of G into a single vertex. For i = 1, 2, ..., d, let Gi be a graph with V (Gi) = V , and let G be a graph with V (G) = V and E(G) = ∩di=1(Gi), then we write G = ∩di=1Gi and call each Gi, i = 1, 2, ..., d a factor of G. The case where ...
متن کاملOn the Parallel Parameterized Complexity of the Graph Isomorphism Problem
In this paper, we study the parallel and the space complexity of the graph isomorphism problem (GI) for several parameterizations. Let H = {H1,H2, · · · ,Hl} be a finite set of graphs where |V (Hi)| ≤ d for all i and for some constant d. Let G be an H-free graph class i.e., none of the graphs G ∈ G contain any H ∈ H as an induced subgraph. We show that GI parameterized by vertex deletion distan...
متن کاملEndomorphism monoids of chained graphs
For any complete chain I whose distinct elements are separated by cover pairs, and for every family {Mi | i∈ I} of monoids, we construct a family of graphs {Gi | i∈ I} such that Gi is a proper induced subgraph of Gj for all i; j∈ I with i ¡ j, Gi = ⋂ {Gj | j∈ I; i ¡ j} whenever i = inf{ j∈ I | j¿ i} in I , Gi = ⋃ {Gj | j∈ I; j ¡ i} whenever i = sup{ j∈ I | j¡ i} in I , the endomorphism monoid o...
متن کامل