Electronic Communications of the EASST (European Association of Software Science and Technology)
Not a member yet
887 research outputs found
Sort by
A Case Study on Graphically Modelling and Detecting Knowledge Mobility Risks
Get PDFAs the world continues to increasingly depend on a knowledge economy, companies are realising that their most valuable asset is knowledge held by their employees. This asset is hard to track, manage and retain especially in a situation where employees are free to job-hop for better pay after providing a few weeks’ notice to their employers. In previous work we have defined the concept of knowledge risk, and presented a graph-based approach for detecting it. In this paper, we present the results of a case study which employs knowledge graphs in the context of four software development teams
HR* Graph Conditions Between Counting Monadic Second-Order and Second-Order Graph Formulas
Get PDFGraph conditions are a means to express structural properties for graph transformation systems and graph programs in a large variety of application areas.With HR* graph conditions, non-local graph properties like “there exists a path of arbitrary length” or “the graph is circle-free” can be expressed. We show, by induction over the structure of formulas and conditions, that (1) any node-counting monadic second-order formula can be expressed by an HR∗ condition and (2) any HR* condition can be expressed by a second-order graph formula
Reusing Model Transformations across Heterogeneous Metamodels
Get PDFModel transformations are key enablers for multi-paradigm modeling. However, currently there is little support for reusing transformations in different contexts since they are tightly coupled to the metamodels they are defined upon, and hence reusing them for other metamodels becomes challenging. Inspired from generic programming, we proposed generic model-to-model transformations, which are defined over so-called metamodel concepts, which are later bound to specific metamodels. Nevertheless, the current binding mechanism lacks automated resolution support for recurring structural heterogeneities between metamodels. Therefore, based on a systematic classification of heterogeneities, we propose a flexible binding mechanism being able to automatically resolve recurring structural heterogeneities between metamodels. For this, the binding model is analyzed and required adaptors are automatically added to the transformation
Mixing Formal and Informal Model Elements for Tracing Requirements
Get PDFTracing between informal requirements and formal models is challenging. A method for such tracing should permit to deal efficiently with changes to both the requirements and the model. A particular challenge is posed by the persisting interplay of formal and informal elements. In this paper, we describe an incremental approach to requirements validation and systems modelling. Formal modelling facilitates a high degree of automation: it serves for validation and traceability. The foundation for our approach are requirements that are structured according to the WRSPM reference model. We provide a system for traceability with a state-based formal method that supports refinement. We do not require all specification elements to be modelled formally and support incremental incorporation of new specification elements into the formal model. Refinement is used to deal with larger amounts of requirements in a structured way. We provide a small example using Problem Frames and Event-B to demonstrate our approach
View-based Modelling and State-Space Generation for Graph Transformation Systems
Get PDFModelling complex systems by graph transformation, we face scalability challenges both in our ability to create and understand these models and in the ability of tools to analyse them. To address these problems we propose to model graph transformation systems in views which can be understood and analysed separately. In particular, we show that transition systems can be generated separately for different views which, when synchronised using a CSP-like operator, yield a system that is bisimilar to the original global system
A hybrid approach for multi-view modeling
Get PDFMulti-view modeling is a widely accepted technique to reduce the complexity in the development of modern software systems. It allows developers to focus on a narrowed portion of the specification dealing with a selected aspect of the problem. However, multi-view modeling support discloses a number of issues: on the one hand consistency management very often has to cope with semantics interconnections between the different concerns. On the other hand, providing a predefined set of views usually results as too restrictive because of expressiveness and customization needs. This paper proposes a hybrid solution for multi-view modeling based on an arbitrary number of custom views defined on top of an underlying modeling language. The aim is to benefit from the consistency by-construction granted by well-defined views while at the same time providing malleable perspectives through which the system under development can be specified
Integration of Triple Graph Grammars and Constraints
Get PDFMetamodels are often augmented with additional constraints that must be satisfied by valid instances of these metamodels. Such constraints express complex conditions that cannot be expressed in the metamodel itself. Model transformations have to take such constraints of the source and target metamodels into account. Given a valid source model, which satisfies the source constraints, a model transformation is expected to return a valid target model (forward validity). However, in current model transformation definition and tool support, such an integration with source and target constraints including validation mechanisms is often ignored or not satisfactory yet.In this paper, we describe how the integration with source and target constraints can be achieved for the special case of model transformations defined by Triple Graph Grammars (TGGs). First, we extend the relational model transformation definition for TGGs and integrate it with source and target constraints. Moreover, we describe how forward/backward validity of TGGs with constraints can be automatically checked, either by static analysis using an invariant checker, or by generating and validating metamodel instances. Finally, we describe how to integrate constraints into our TGG-based model transformation implementation and automatic conformance testing framework
Teaching MDE through the Formal Verification of Process Models
Get PDFModel Driven Engineering (MDE) and formal methods (FM) play a key role in the development of Safety Critical Systems (SCS). They promote user ori- ented abstraction and formal specification using Domain Specific Modeling Lan- guages (DSML), early Validation and formal Verification (V&V) using efficient dedicated technologies and Automatic Code and Documentation Generation. Their combined use allow to improve system qualities and reduce development costs. However, in most computer science curriculae, both domains are usually taught independently. MDE is associated to practical software engineering and FM to the- oretical computer science. This contribution relates a course about MDE for SCS development that bridges the gap between these domains. It describes the content of the course and provides the lessons learned from its teaching. It focuses on early formal verification using model checking of a DSML for development process mod- eling. MDE technologies are illustrated both on language engineering for CASE tool development and on development process modeling. The case study also highlights the unification power of MDE as it does not target traditional executable software
A generic in-place transformation-based approach to structured model co-evolution
Get PDFIn MDE not only models but also metamodels are subject to evolution. More specifically, they need to be adapted to correct errors, support new and/or update language features. The direct consequence of such evolutionary steps comprises the problem of managing the co-evolution of existing model instances, which may no longer conform to the new metamodel version. This model migration is intrinsically complex and results in a time-consuming and error-prone process if no adequate support is provided. For tackling this problem, we introduce a new technique to guide the user in solving migration issues in a step-wise manner. The aims are manifold, notably the simplification of the migration specification, the reduction of the effort for the evolver, the control of user intervention, and the optimization of the migration execution itself by allowing in-place adaptation of the existing instances