Author
Elvira Pino
Other affiliations: Polytechnic University of Puerto Rico
Bio: Elvira Pino is an academic researcher from Polytechnic University of Catalonia. The author has contributed to research in topics: Operational semantics & Semantics (computer science). The author has an hindex of 6, co-authored 26 publications receiving 127 citations. Previous affiliations of Elvira Pino include Polytechnic University of Puerto Rico.
Papers
More filters
TL;DR: The main result shows existence and uniqueness of the semantics of an architecture as a normal form of reduction step sequences in the sense of graph reductions.
20 citations
TL;DR: The method proposed consists in studying the adequate institution for describing the given class of logic programs and in using general institution-independent results to prove compositionality and full abstraction.
16 citations
TL;DR: It is shown 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.
Abstract: 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.
12 citations
TL;DR: This paper presents an important extension of the contribution to FESCA '04, which presented a generic framework for connector architectures, enriched by the possibility of handling overlapping connector interfaces, that can be applied to UML class diagrams, state machines and sequence diagrams as heterogeneous specification techniques.
10 citations
21 Jul 2014
TL;DR: In model-driven software development, there may be several models describing the same system or artifact, by providing different views on it, but it is said that these models are consistently integrated.
Abstract: 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.
9 citations
Cited by
More filters
TL;DR: A feature-based classification system for model repair techniques, based on an systematic literature review of the area, is proposed 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.
Abstract: 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.
62 citations
TL;DR: A new approach to deal with attributed graphs and attributed graph transformation is presented, based on working with what the authors call symbolic graphs, which are graphs labelled with variables together with a formula that constrains the possible values that they may assign to these variables.
Abstract: 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.
54 citations
TL;DR: It is shown that a number of important properties of the institution I inherited by S ( I) are indeed inherited, including cocompleteness of the category of theories, liberality, and extension of the basic framework by free-ness constraints.
37 citations
TL;DR: The basic logic programming semantic concepts, query, solutions, solution forms, and the fundamental results such as Herbrand theorems are developed over any logical system, formalised as institution, by employing ‘institution-independent’ concepts of variable, substitution, quantifier, and atomic formulae.
36 citations