Searching Arxiv, refresh for possibly better results.
Results for "Maribel Ortego"
total 43took 0.05s
Multivariate statistical modelling of future marine stormsMar 13 2019Extreme events, such as wave-storms, need to be characterized for coastal infrastructure design purposes. Such description should contain information on both the univariate behaviour and the joint-dependence of storm-variables. These two aspects have ... More Proceedings 24th International Workshop on UnificationDec 21 2010This volume contains selected papers presented at the 24th International Workshop on Unification, UNIF2010, which was held in Edinburgh on the 14th July 2010, as part of FLoC 2010 (Federated Logic Conferences). Strategic programming on graph rewriting systemsDec 27 2010We describe a strategy language to control the application of graph rewriting rules, and show how this language can be used to write high-level declarative programs in several application areas. This language is part of a graph-based programming tool ... More Higher-order port-graph rewritingNov 17 2012The biologically inspired framework of port-graphs has been successfully used to specify complex systems. It is the basis of the PORGY modelling tool. To facilitate the specification of proof normalisation procedures via graph rewriting, in this paper ... More Static Enforcement of Role-Based Access ControlSep 09 2014We propose a new static approach to Role-Based Access Control (RBAC) policy enforcement. The static approach we advocate includes a new design methodology, for applications involving RBAC, which integrates the security requirements into the system's architecture. ... More From nominal to higher-order rewriting and back againSep 17 2015Dec 11 2015We present a translation function from nominal rewriting systems (NRSs) to combinatory reduction systems (CRSs), transforming closed nominal rules and ground nominal terms to CRSs rules and terms, respectively, while preserving the rewriting relation. ... More Assembling the Proofs of Ordered Model TransformationsFeb 21 2013In model-driven development, an ordered model transformation is a nested set of transformations between source and target classes, in which each transformation is governed by its own pre and post- conditions, but structurally dependent on its parent. ... More Labelled Lambda-calculi with Explicit Copy and EraseMar 29 2010We present two rewriting systems that define labelled explicit substitution lambda-calculi. Our work is motivated by the close correspondence between Levy's labelled lambda-calculus and paths in proof-nets, which played an important role in the understanding ... More Graph Creation, Visualisation and TransformationMar 23 2010We describe a tool to create, edit, visualise and compute with interaction nets - a form of graph rewriting systems. The editor, called GraphPaper, allows users to create and edit graphs and their transformation rules using an intuitive user interface. ... More General dynamic recovery for compensating CSPApr 01 2014Compensation is a technique to roll-back a system to a consistent state in case of failure. Recovery mechanisms for compensating calculi specify the order of execution of compensation sequences. Dynamic recovery means that the order of execution is determined ... More Bigraphical NetsFeb 26 2013Interaction nets are a graphical model of computation, which has been used to define efficient evaluators for functional calculi, and specifically lambda calculi with patterns. However, the flat structure of interaction nets forces pattern matching and ... More A new graphical calculus of proofsFeb 14 2011We offer a simple graphical representation for proofs of intuitionistic logic, which is inspired by proof nets and interaction nets (two formalisms originating in linear logic). This graphical calculus of proofs inherits good features from each, but is ... More Class of Eistein-Maxwell DilatonsAug 28 2000The functional potential formalism is used to analyze stationary axisymmetric spaces in the Einstein-Maxwell-Dilaton theory. Performing a Legendre transformation, a ``Hamiltonian''is obtained, which allows to rewrite the dynamical equations in terms of ... More Attributed Hierarchical Port Graphs and ApplicationsFeb 19 2018We present attributed hierarchical port graphs (AHP) as an extension of port graphs that aims at facilitating the design of modular port graph models for complex systems. AHP consist of a number of interconnected layers, where each layer defines a port ... More On Nominal Syntax and Permutation Fixed PointsFeb 22 2019We propose a new axiomatisation of the alpha-equivalence relation for nominal terms, based on a primitive notion of fixed-point constraint. We show that the standard freshness relation between atoms and terms can be derived from the more primitive notion ... More Linear RecursionJan 19 2010Jan 14 2011We show that the full PCF language can be encoded in Lrec, a linear lambda-calculus extended with numbers, pairs and an unbounded recursor that preserves the syntactic linearity of the calculus. Thus, Lrec is a Turing complete extension of the linear ... More Linear RecursionJan 19 2010Nov 25 2016We define two extensions of the typed linear lambda-calculus that yield minimal Turing-complete systems. The extensions are based on unbounded recursion in one case, and bounded recursion with minimisation in the other. We show that both approaches are ... More PORGY: Strategy-Driven Interactive Transformation of GraphsFeb 14 2011This paper investigates the use of graph rewriting systems as a modelling tool, and advocates the embedding of such systems in an interactive environment. One important application domain is the modelling of biochemical systems, where states are represented ... More Nominal C-UnificationSep 15 2017Nominal unification is an extension of first-order unification that takes into account the \alpha-equivalence relation generated by binding operators, following the nominal approach. We propose a sound and complete procedure for nominal unification with ... More Spiders can be recognized by counting their legsNov 08 2014Spiders are arthropods that can be distinguished from their closest relatives, the insects, by counting their legs. Spiders have 8, insects just 6. Spider graphs are a very restricted class of graphs that naturally appear in the context of cograph editing. ... More Cloud-based Evolutionary Algorithms: An algorithmic studyMay 31 2011After a proof of concept using Dropbox(tm), a free storage and synchronization service, showed that an evolutionary algorithm using several dissimilar computers connected via WiFi or Ethernet had a good scaling behavior in terms of evaluations per second, ... More Concurrent and Accurate RNA Sequencing on Multicore PlatformsApr 02 2013In this paper we introduce a novel parallel pipeline for fast and accurate mapping of RNA sequences on servers equipped with multicore processors. Our software, named HPG-Aligner, leverages the speed of the Burrows-Wheeler Transform to map a large number ... More Best Match GraphsMar 29 2018Dec 14 2018Best match graphs arise naturally as the first processing intermediate in algorithms for orthology detection. Let $T$ be a phylogenetic (gene) tree $T$ and $\sigma$ an assignment of leaves of $T$ to species. The best match graph $(G,\sigma)$ is a digraph ... More