Pino, Elvira

Foto de perfil

E-mails conocidos

Fecha de nacimiento

Proyectos de investigación

Unidades organizativas

Puesto de trabajo



Nombre de pila



Nombres alternativos

Afiliaciones conocidas

Universitat Politècnica de Catalunya, Spain

Páginas web conocidas

Página completa del ítem
Notificar un error en este autor

Resultados de la búsqueda

Mostrando 1 - 3 de 3
  • Artículo
    Towards a Logical Approach to Graph Databases
    Pino, Elvira; Orejas, Fernando; Mylonakis, Nicos; Pasarella, Edelmira. Actas de las XXI Jornadas de Programación y Lenguajes (PROLE 2022), 2022-09-05.
    Graph databases are now playing an important role, not only because they allow us to overcome some limitations of relational databases, but also because they provide a good model for searching the web. In particular, graph databases differ from relational databases in that the topology of data is as important as the data itself. Thus, typical graph database queries are navigational, asking whether some nodes are connected by paths satisfying some specific properties. While relational databases were designed upon logical and algebraic foundations, the development of graph databases has been quite ad-hoc. In this sense, the aim of this paper is to provide them with some logical foundations. More precisely, in previous work we introduced a navigational logic, called +AFw-GNL+AFw (Graph Navigational Logic) that allows us to describe graph navigational properties. Moreover, this logic is equipped with a deductive tableau method that we proved to be sound and complete. In the current paper, we show how graph queries +AHsAXA-it +AOA la+AH0 Cypher can be expressed using a fragment of +AFw-GNL, defining for them a logical and an operational semantics. Moreover, we show that this operational semantics is sound and complete.
  • Artículo
    Incremental Concurrent Synchronization with Conflict Resolution
    Pino, Elvira; Navarro, Marisa; Orejas, Fernando. Actas de las XIX Jornadas de Programación y Lenguajes (PROLE 2019), 2019-09-02.
    In the context of software model-driven development, artifacts are specified by several models describing different aspects, e.g., different views, dynamic behaviour, structure, etc. Then, a given set of models is emph{consistently integrated} if they describe some artifact. Along the process of designing and implementing an artifact, and also after the artifact is implemented, it may be common to modify or update some aspects of a given model, or of several models. These changes may cause an inconsistency between the given set of models. To restore consistency, we have to emph{propagate} the given modifications to the rest of the models. This process is called emph{model synchronization}. If each time we propagate the updates on just one model, synchronization is emph{sequential}, but if we propagate simultaneously updates on two models, synchronization is called emph{concurrent}. The sequential case is quite simpler than the concurrent one, since in the latter case we may have to deal with conflicts between the modifications applied to different models, implying that we may need to backtrack some updates. For simplicity, we assume that the set of models describing an artifact consists just of two models. Then, following the ideas of a previous paper on sequential synchronization, in the current paper, we propose an incremental procedure for the concurrent case, meaning that our procedure does not build the resulting models from scratch, but it only modifies the parts of the models affected by the update.
  • Artículo
    A Logic of Graph Conditions Extended with Paths
    Navarro, Marisa; Orejas, Fernando; Pino, Elvira; Lambers, Leen. Actas de las XVI Jornadas de Programación y Lenguajes (PROLE 2016), 2016-09-02.
    In this paper we tackle the problem of extending the logic of nested graph conditions with paths. This means, for instance, that we may state properties about the existence of paths between some given nodes. As a main contribution, a sound and complete tableau method is defined for reasoning about this kind of properties.