Ara es mostren els items 1-20 de 44

    • A Distributed and mobile component system based on the ambient calculus 

      Mylonakis Pascual, Nicolás; Orejas Valdés, Fernando (2004-06)
      Report de recerca
      Accés obert
      In this paper we present a new component concept equivalent to a previous one which is more appropiate for distributed applications. After that, we present the notion of component system and define a set of operations of ...
    • A Framework of hierarchical graphs and its application to the semantics of SRML 

      Mylonakis Pascual, Nicolás; Orejas Valdés, Fernando (2012)
      Report de recerca
      Accés obert
      Hierarchical grapsh or, in general, hierarchical graph structures are needed when describing visual models at different levels of abstraction. This is the case of the semantic model of SRML, the service modeling language ...
    • A graph-semantics of business configurations 

      Fiadeiro, José Luiz; Mylonakis Pascual, Nicolás; Orejas Valdés, Fernando (2014)
      Report de recerca
      Accés obert
      In this paper we give graph-semantics to a fundamental part of the semantics of the service modeling language SRML. To achieve this goal we develop a new graph transformation system for what we call 2-level symbolic graphs. ...
    • A logic of graph conditions extended with paths 

      Navarro Gomez, Marisa; Orejas Valdés, Fernando; Pino Blanco, Elvira; Lambers, Leen (2016)
      Text en actes de congrés
      Accés obert
      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 ...
    • A logic of graph conditions extended with paths 

      Navarro Gomez, Marisa; Orejas Valdés, Fernando; Pino Blanco, Elvira; Lambers, Leen (2016)
      Text en actes de congrés
      Accés obert
      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 ...
    • A logic-based incremental approach to graph repair featuring delta preservation 

      Schneider, Sven; Lambers, Leen; Orejas Valdés, Fernando (Springer Nature, 2021-07-07)
      Article
      Accés obert
      We introduce a logic-based incremental approach to graph repair, generating a sound and complete (upon termination) overview of least-changing graph repairs from which a user may select a graph repair based on non-formalized ...
    • A module concept within the initial behaviour framework 

      Nivela Alós, M. Pilar Brígida; Orejas Valdés, Fernando (1988)
      Report de recerca
      Accés obert
      A module concept is defined which anables the description of the whole design of software systems, that is, not only the specifications of problem requirements but also the specification of the process of implementation ...
    • A navigational logic for reasoning about graph properties 

      Navarro Gómez, Marisa; Orejas Valdés, Fernando; Pino Blanco, Elvira; Lambers, Leen (2021-01)
      Article
      Accés obert
      Graphs play an important role in many areas of Computer Science. In particular, our work is motivated by model-driven software development and by graph databases. For this reason, it is very important to have the means to ...
    • A semantics of business configurations using symbolic graphs 

      Mylonakis Pascual, Nicolás; Orejas Valdés, Fernando; Fiadeiro, José Luiz (Institute of Electrical and Electronics Engineers (IEEE), 2015)
      Text en actes de congrés
      Accés obert
      In this paper we give graph-semantics to a fundamental part of the semantics of the service modeling language SRML: business configurations. To achieve this goal we use symbolic graph transformation systems. We formalize ...
    • Abstract constraint data types 

      Fiadeiro, José Luiz; Orejas Valdés, Fernando (2015)
      Article
      Accés obert
      Martin Wirsing is one of the earliest contributors to the area of Algebraic Specification (e.g., [2]), which he explored in a variety of domains over many years. Throughout his career, he has also inspired countless ...
    • Amalgamation of domain specific languages with behaviour 

      Duran, Francisco; Moreno Delgado, Antonio; Orejas Valdés, Fernando; Zschaler, Steffen (2017-01-01)
      Article
      Accés obert
      Domain-specific languages (DSLs) become more useful the more specific they are to a particular domain. The resulting need for developing a substantial number of DSLs can only be satisfied if DSL development can be made as ...
    • An abstract semantic framework for mobile component systems based on graph transformation (Extended abstract) 

      Mylonakis Pascual, Nicolás; Orejas Valdés, Fernando (2005-12)
      Report de recerca
      Accés obert
      The aim of this work is the definition of a generic framework for the modelling and development of component-based distributed applications with mobile processes in the internet. We describe component systems as typed ...
    • An Algebraic framework for the definition of compositional semantics of normal logic programs 

      Lucio, Paqui; Orejas Valdés, Fernando; Pino Blanco, Elvira (1997-11)
      Report de recerca
      Accés obert
      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 ...
    • An equational approach to concurrency 

      Orejas Valdés, Fernando (Universidad del Pais Vasco, 1982)
      Comunicació de congrés
      Accés obert
      In this paper, we describe how can we use equations to specify the behavour of concurrent processes.
    • Anotaciones de Merlín, comportamiento de universos y semántica algebraica 

      Nivela Alós, M. Pilar Brígida; Orejas Valdés, Fernando (E.T.S.I. de Telecomunicación, 1985)
      Text en actes de congrés
      Accés obert
      En este trabajo se presentan las ideas básicas seguidas para el diseño de un lenguaje de anotaciones para el lenguaje de programación Merlín. En concreto, las anotaciones se prevén en forma de especificaciones ecuacionales ...
    • Another fully abstract graph semantics for the ambient calculus 

      Mylonakis Pascual, Nicolás; Orejas Valdés, Fernando (2007-06)
      Report de recerca
      Accés obert
      The long-term aim of this work is the definition of a framework for the modelling and development of distributed mobile component-based applications. As a first step we provide a fully abstract graph semantics for the ...
    • Automated reasoning for attributed graph properties 

      Schneider, Sven; Lambers, Leen; Orejas Valdés, Fernando (2018-11)
      Article
      Accés obert
      Graphs are ubiquitous in computer science. Moreover, in various application fields, graphs are equipped with attributes to express additional information such as names of entities or weights of relationships. Due to the ...
    • Behavioural approach to modular system specification 

      Ehrig, Hartmut; Nivela Alós, M. Pilar Brígida; Orejas Valdés, Fernando (1988-07)
      Report de recerca
      Accés obert
      The algebraic approach to modular specifications as developed by the first author during the last five years is joined with the behavioural approach to algebraic specifications introduced recently by the last two authors. ...
    • Borrowed contexts for attributed graphs 

      Orejas Valdés, Fernando; Boronat Moll, Artur; Mylonakis Pascual, Nicolás (2012)
      Report de recerca
      Accés obert
      Borrowed context graph transformation is a simple and powerful technique developed by Ehrig and König that allow us to derive labeled transitions and bisimulation congruences for graph transformation systems or, in general, ...
    • Checking bisimilarity for attributed graph transformation 

      Orejas Valdés, Fernando; Boronat Moll, Artur; Golas, Ulrike; Mylonakis Pascual, Nicolás (2012)
      Report de recerca
      Accés obert
      Borrowed context graph transformation is a technique developed by Ehrig and Koenig to define bisimilarity congruences from reduction semantics defined by graph transformation. This means that, for instance, this technique ...