5 papers
Properties for Paths in Graph Databases
Fernando Orejas, Elvira Pino, Renzo Angles +2
This paper presents a formalism for defining properties of paths in graph databases, which can be used to restrict the number of solutions to navigational queries. In particular, o…
Taint Analysis for Graph APIs Focusing on Broken Access Control
Leen Lambers, Lucas Sakizloglou, Taisiya Khakharova +1
We present the first systematic approach to static and dynamic taint analysis for Graph APIs focusing on broken access control. The approach comprises the following. We taint nodes…
Coinductive Techniques for Checking Satisfiability of Generalized Nested Conditions
Lara Stoltenow, Barbara König, Sven Schneider +3
We study nested conditions, a generalization of first-order logic to a categorical setting, and provide a tableau-based (semi-decision) procedure for checking (un)satisfiability an…
Drag Rewriting
Nachum Dershowitz, Jean-Pierre Jouannaud, Fernando Orejas
We present a new and powerful algebraic framework for graph rewriting, based on drags, a class of graphs enjoying a novel composition operator. Graphs are embellished with roots an…
Initial Conflicts for Transformation Rules with Nested Application Conditions
Leen Lambers, Fernando Orejas
We extend the theory of initial conflicts in the framework of M-adhesive categories to transformation rules with ACs. We first show that for rules with ACs, conflicts are in genera…