[서평]「Component Software」 - Beyond Object-Oriented Programming -

Consistency management, the ability to detect, diagnose and handle inconsistencies, is crucial during the development process in Model-driven Engineering (MDE). As the popularity and application scenarios of MDE expanded, a variety of different techniques were proposed to address these tasks in specific contexts. Of the various stages of consistency management, this work focuses on inconsistency handling in MDE, particularly in model repair techniques. This paper proposes a feature-based classification system for model repair techniques, based on an systematic literature review of the area. We expect this work to assist developers and researchers from different disciplines in comparing their work under a unifying framework, and aid MDE practitioners in selecting suitable model repair approaches.

/pdf/a-feature-based-classification-of-model-repair-approaches-51po5hxlp8.pdf

A Feature-Based Classification of Model Repair Approaches

In this paper we present a new approach to deal with attributed graphs and attributed graph transformation. This approach is based on working with what we call symbolic graphs, which are graphs labelled with variables together with a formula that constrains the possible values that we may assign to these variables. In particular, in this paper we will compare in detail this new approach with the standard approach to attributed graph transformation.

/pdf/symbolic-attributed-graphs-for-attributed-graph-1tr9ew557p.pdf

Symbolic Attributed Graphs for Attributed Graph Transformation

Structured Theories and Institutions

Herbrand theorems in arbitrary institutions

https://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers05/EPB+04.pdf

A Generic Framework for Connector Architectures based on Components and Transformations

Institutions for logic programming

The aim of our work is the definition of compositional semantics for modular units over the class of normal logic programs. In this sense, we propose a declarative semantics for normal logic programs in terms of model classes that is monotonic in the sense that Mod (P∪P′) ⊆ Mod (P) , for any programs P and P′ and we show that in the model class associated to every program there is a least model that can be seen as the semantics of the program, which may be built upwards as the least fix point of a continuous immediate consequence operator. In addition, it is proved that this least model is “typical” for the class of models of Clark-Kunen's completion of the program. This means that our semantics is equivalent to Clark-Kunen's completion. Moreover, following the approach defined in a previous paper, it is shown that our semantics constitutes a “specification frame ” equipped with the adequate categorical constructions needed to define compositional and fully abstract (categorical) semantics for a number of program units. In particular, we provide a categorical semantics of arbitrary normal logic program fragments which is compositional and fully abstract with respect to the (standard) union.

/pdf/an-algebraic-framework-for-the-definition-of-compositional-45qx6ztj1x.pdf

An Algebraic framework for the definition of compositional semantics of normal logic programs

Object-Oriented Connector-Component Architectures

In model-driven software development, we may have several models describing the same system or artifact, by providing different views on it. In this case, we say that these models are consistently integrated.

/pdf/correctness-of-incremental-model-synchronization-with-triple-5axtciihpb.pdf

Elvira Pino

Papers

A Generic Framework for Connector Architectures based on Components and Transformations

Institutions for logic programming

An Algebraic framework for the definition of compositional semantics of normal logic programs

Object-Oriented Connector-Component Architectures

Correctness of incremental model synchronization with triple graph grammars