2,904 research outputs found

    Model Transformation Modularization as a Many-Objective Optimization Problem

    Get PDF
    Model transformation programs are iteratively refined, restructured, and evolved due to many reasons such as fixing bugs and adapting existing transformation rules to new metamodels version. Thus, modular design is a desirable property for model transformations as it can significantly improve their evolution, comprehensibility, maintainability, reusability, and thus, their overall quality. Although language support for modularization of model transformations is emerging, model transformations are created as monolithic artifacts containing a huge number of rules. To the best of our knowledge, the problem of automatically modularizing model transformation programs was not addressed before in the current literature. These programs written in transformation languages, such as ATL, are implemented as one main module including a huge number of rules. To tackle this problem and improve the quality and maintainability of model transformation programs, we propose an automated search-based approach to modularize model transformations based on higher-order transformations. Their application and execution is guided by our search framework which combines an in-place transformation engine and a search-based algorithm framework. We demonstrate the feasibility of our approach by using ATL as concrete transformation language and NSGA-III as search algorithm to find a trade-off between different well-known conflicting design metrics for the fitness functions to evaluate the generated modularized solutions. To validate our approach, we apply it to a comprehensive dataset of model transformations. As the study shows, ATL transformations can be modularized automatically, efficiently, and effectively by our approach. We found that, on average, the majority of recommended modules, for all the ATL programs, by NSGA-III are considered correct with more than 84% of precision and 86% of recall when compared to manual solutions provided by active developers. The statistical analysis of our experiments over several runs shows that NSGA-III performed significantly better than multi-objective algorithms and random search. We were not able to compare with existing model transformations modularization approaches since our study is the first to address this problem. The software developers considered in our experiments confirm the relevance of the recommended modularization solutions for several maintenance activities based on different scenarios and interviews.Comisión Interministerial de Ciencia y Tecnología TIN2015-70560-RJunta de Andalucía P12-TIC-186

    Search‐based model transformations

    Get PDF
    Model transformations are an important cornerstone of model‐driven engineering, a discipline which facilitates the abstraction of relevant information of a system as models. The success of the final system mainly depends on the optimization of these models through model transformations. Currently, the application of transformations is realized either by following the apply‐as‐long‐as‐possible strategy or by the provision of explicit rule orchestrations. This implies two main limitations. First, the optimization objectives are implicitly hidden in the transformation rules and their orchestration. Second, manually finding the best orchestration for a particular scenario is a major challenge due to the high number of possible combinations. To overcome these limitations, we present a novel framework that builds on the non‐intrusive integration of optimization and model transformation technologies. In particular, we formulate the transformation orchestration task as an optimization problem, which allows for the efficient exploration of the transformation space and explication of the transformation objectives. Our generic framework provides several search algorithms and guides the user in providing a proper search configuration. We present different instantiations of our framework to demonstrate its feasibility, applicability, and benefits using several case studiesEuropean Commission ICT Policy Support Programme 317859Ministerio de Economia y Competitividad TIN2015-70560-RJunta de Andalucía P10-TIC-5960Junta de Andalucía P12-TIC-186

    Towards Generic Modularization Transformations

    Get PDF
    Modularization concepts have been introduced in several modeling languages in order to tackle the problem that real-world models quickly become large monolithic artifacts. Having these concepts at hand allows for structuring models during modeling activities. However, legacy models often lack a proper structure, and thus, still remain monolithic artifacts. In order to tackle this problem, we present in this paper a modularization transformation which can be reused for several modeling languages by binding their concrete concepts to the generic ones offered by the modularization transformation. This binding is enough to reuse different modularization strategies provided by search-based model transformations. We demonstrate the applicability of the modularization approach for Ecore models.Ministerio de Economía y Competitividad TIN2012-32273Junta de Andalucía TIC-5906Junta de Andalucía P12-TIC-186

    Search based software engineering: Trends, techniques and applications

    Get PDF
    © ACM, 2012. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version is available from the link below.In the past five years there has been a dramatic increase in work on Search-Based Software Engineering (SBSE), an approach to Software Engineering (SE) in which Search-Based Optimization (SBO) algorithms are used to address problems in SE. SBSE has been applied to problems throughout the SE lifecycle, from requirements and project planning to maintenance and reengineering. The approach is attractive because it offers a suite of adaptive automated and semiautomated solutions in situations typified by large complex problem spaces with multiple competing and conflicting objectives. This article provides a review and classification of literature on SBSE. The work identifies research trends and relationships between the techniques applied and the applications to which they have been applied and highlights gaps in the literature and avenues for further research.EPSRC and E

    Repurposing existing skeletal spatial structure (SkS) system designs using the Field Information Modeling (FIM) framework for generative decision-support in future construction projects

    Get PDF
    Skeletal spatial structure (SkS) systems are modular systems which have shown promise to support mass customization, and sustainability in construction. SkS have been used extensively in the reconstruction efforts since World War II, particularly to build geometrically flexible and free-form structures. By employing advanced digital engineering and construction practices, the existing SkS designs may be repurposed to generate new optimal designs that satisfy current construction demands of contemporary societies. To this end, this study investigated the application of point cloud processing using the Field Information Modeling (FIM) framework for the digital documentation and generative redesign of existing SkS systems. Three new algorithms were proposed to (i) expand FIM to include generative decision-support; (ii) generate as-built building information modeling (BIM) for SkS; and (iii) modularize SkS designs with repeating patterns for optimal production and supply chain management. These algorithms incorporated a host of new AI-inspired methods, including support vector machine (SVM) for decision support; Bayesian optimization for neighborhood definition; Bayesian Gaussian mixture clustering for modularization; and Monte Carlo stochastic multi-criteria decision making (MCDM) for selection of the top Pareto front solutions obtained by the non-dominant sorting Genetic Algorithm (NSGA II). The algorithms were tested and validated on four real-world point cloud datasets to solve two generative modeling problems, namely, engineering design optimization and facility location optimization. It was observed that the proposed Bayesian neighborhood definition outperformed particle swarm and uniform sampling by 34% and 27%, respectively. The proposed SVM-based linear feature detection outperformed k-means and spectral clustering by 56% and 9%, respectively. Finally, the NSGA II algorithm combined with the stochastic MCDM produced diverse “top four” solutions based on project-specific criteria. The results indicate promise for future utilization of the framework to produce training datasets for generative adversarial networks that generate new designs based only on stakeholder requirements

    Model refactoring by example: A multi‐objective search based software engineering approach

    Full text link
    Declarative rules are frequently used in model refactoring in order to detect refactoring opportunities and to apply the appropriate ones. However, a large number of rules is required to obtain a complete specification of refactoring opportunities. Companies usually have accumulated examples of refactorings from past maintenance experiences. Based on these observations, we consider the model refactoring problem as a multi objective problem by suggesting refactoring sequences that aim to maximize both structural and textual similarity between a given model (the model to be refactored) and a set of poorly designed models in the base of examples (models that have undergone some refactorings) and minimize the structural similarity between a given model and a set of well‐designed models in the base of examples (models that do not need any refactoring). To this end, we use the Non‐dominated Sorting Genetic Algorithm (NSGA‐II) to find a set of representative Pareto optimal solutions that present the best trade‐off between structural and textual similarities of models. The validation results, based on 8 real world models taken from open‐source projects, confirm the effectiveness of our approach, yielding refactoring recommendations with an average correctness of over 80%. In addition, our approach outperforms 5 of the state‐of‐the‐art refactoring approaches.Peer Reviewedhttps://deepblue.lib.umich.edu/bitstream/2027.42/143783/1/smr1916.pdfhttps://deepblue.lib.umich.edu/bitstream/2027.42/143783/2/smr1916_am.pd

    The role of 1st tier suppliers in automobile product modularisation: the search for a coherent strategy

    Get PDF
    Modularization is a growing concept in auto industry. Architectural decisions had been many time studied from the car maker's point of view. This article addresses the question of supplier's strategy in the modular business. A prior publication (Fourcade Midler 2004) showed that supplier's involvement could take various forms, from light coordination to heavy investment in deep module redesign. This article will investigate how these different modular involvement profile could fit in general 1st Tier supplier's strategy. It is based both on a general study of automotive suppliers industrial field and an interactive research that we have been pursuing in conjunction with one 1st Tier supplier since 2001.

    On the Value of Quality Attributes for Refactoring Model Transformations Using a Multi-Objective Algorithm

    Full text link
    Peer Reviewedhttps://deepblue.lib.umich.edu/bitstream/2027.42/152454/1/QMOOD_for_ATL__Copy_.pd

    Genetic algorithms

    Get PDF
    Genetic algorithms are mathematical, highly parallel, adaptive search procedures (i.e., problem solving methods) based loosely on the processes of natural genetics and Darwinian survival of the fittest. Basic genetic algorithms concepts are introduced, genetic algorithm applications are introduced, and results are presented from a project to develop a software tool that will enable the widespread use of genetic algorithm technology
    corecore