Search
Search Results
-
Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming
In the field of Model-Driven Engineering, Triple Graph Grammars (TGGs) play an important role as a rule-based means of implementing consistency...
-
Ensuring User Interface Adaptation Consistency Through Triple Graph Grammars
As modern User Interfaces (UIs) are used in varying context-of-use situations, sophisticated mechanisms to control UI adaptations are needed. UI... -
Bonding Grammars
We introduce bonding grammars, a graph grammar formalism developed to model DNA computation. It is a modification of fusion grammars introduced by... -
A general parsing algorithm with context matching for context-sensitive graph grammars
Context-sensitive graph grammars have been intuitive and rigorous formalisms for specifying visual programming languages, as they are sufficient...
-
Avoiding unnecessary information loss: correct and efficient model synchronization based on triple graph grammars
Model synchronization, i.e., the task of restoring consistency between two interrelated models after a model change, is a challenging task. Triple...
-
Dependency-enhanced graph convolutional networks for aspect-based sentiment analysis
Aspect-based sentiment analysis aims to extract aspect and opinion terms, and identify the sentiment polarities for such terms. The majority of...
-
ACGtk: A Toolkit for Develo** and Running Abstract Categorial Grammars
Abstract categorial grammars (ACGs) is an expressive grammatical framework whose formal properties have been extensively studied. While it can... -
Module Integration Using Graph Grammars (MIGRATE)
Software, whether desktop, mobile or web, is becoming more and more connected. Software development is also becoming more connected with ecosystems... -
Path Querying on Acyclic Graphs Using Boolean Grammars
AbstractGraph data models are widely employed in different areas of computer science, e.g., graph databases, bioinformatics, social network analysis,...
-
Pushdown Automata and Context-Free Grammars
In this chapter we study the class of pushdown automata and their relation to the class of context-free grammars and languages. We also consider... -
Incremental Concurrent Model Synchronization using Triple Graph Grammars
In the context of software model-driven development, artifacts are specified by several models describing different aspects, e.g., different views,... -
HGAT: smart contract vulnerability detection method based on hierarchical graph attention network
With the widespread use of blockchain, more and more smart contracts are being deployed, and their internal logic is getting more and more...
-
Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming
Triple Graph Grammars (TGGs) are a declarative and rule-based approach to bidirectional model transformation. The key feature of TGGs is the... -
Unfolding Symbolic Attributed Graph Grammars
Attributed graph grammars can specify the transformation of complex data and object structures within a natural rule-based model of concurrency.... -
Basic Algorithmics of Multiset Grammars and Metagrammars
Chapter 4 is dedicated to MGF enhanced algorithmics enabling development of MG-centered schedulers of... -
-
Rule-Based Top-Down Parsing for Acyclic Contextual Hyperedge Replacement Grammars
Contextual hyperedge replacement (CHR) strengthens the generative power of hyperedge replacement (HR) significantly, thus increasing its usefulness... -
Comprehensive Systems: A formal foundation for Multi-Model Consistency Management
Model management is a central activity in Software Engineering. The most challenging aspect of model management is to keep inter-related models...
-
Simple Question Answering over Knowledge Graph Enhanced by Question Pattern Classification
Question answering over knowledge graph (KGQA), which automatically answers natural language questions by querying the facts in knowledge graph (KG),...
-
Model Transformation with Triple Graph Grammars and Non-terminal Symbols
This work proposes a new graph grammar formalism, that introduces non-terminal symbols to triple graph grammars (TGG) and shows how to apply it to...