Parallelization of graph transformation based on incremental pattern matching

G Bergmann, I Ráth, D Varró - Electronic Communications of the EASST, 2009 - eceasst.org
Graph transformation based on incremental pattern matching explicitly stores all
occurrences of patterns (left-hand side of rules) and updates this result cache upon model …

Incremental model queries in model-driven design

G Bergmann - 2013 - search.proquest.com
The discipline of model-driven engineering (MDE) is gaining more acceptance in several
areas of software and system engineering as it delivers higher-quality products in a shorter …

Concurrent goal-based execution of constraint handling rules

ESL Lam, M Sulzmann - Theory and Practice of Logic Programming, 2011 - cambridge.org
We introduce a systematic, concurrent execution scheme for Constraint Handling Rules
(CHR) based on a previously proposed sequential goal-based CHR semantics. We …

[PDF][PDF] Parallel execution of constraint handling rules-Theory, implementation and application

E LAM SOON LEE - 2010 - edmundsllam.wordpress.com
Summary Constraint Handling Rules (CHR) is a concurrent committed choice rule based
programming language designed specifically for the implementation of incremental …

Diamond: a Rete-match linked data SPARQL environment

RK Depena - 2010 - repositories.lib.utexas.edu
Diamond is a SPARQL query engine for linked data. Linked data is a sub-topic of the
Semantic Web where data is represented as a labeled directed graph using the Resource …

[PDF][PDF] Seventh International Workshop on Graph Transformation and Visual Modeling Techniques

D Grohmann, M Miculan - Electronic Communications of the EASST, 2008 - air.uniud.it
We study directed bigraph with negative ports, a bigraphical framework for representing
models for distributed, concurrent and ubiquitous computing. With respect to previous …