Graph grammars with negative application conditions
Fundamenta Informaticae - Special issue on graph transformations
Logic based programmed structure rewriting systems
Fundamenta Informaticae - Special issue on graph transformations
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Formal Methods in Software and Systems Modeling: Essays Dedicated to Hartmut Ehrig on the Occasion of His 60th Birthday (Lecture Notes in Computer Science)
Parallel Graph Transformation for Model Simulation applied to Timed Transition Petri Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Defining object-oriented execution semantics using graph transformations
FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
High-Level Programs and Program Conditions
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
A Collection Operator for Graph Transformation
ICMT '09 Proceedings of the 2nd International Conference on Theory and Practice of Model Transformations
Matrix Graph Grammars with Application Conditions
Fundamenta Informaticae
Journal of Visual Languages and Computing
A visual token-based formalization of BPMN 2.0 based on in-place transformations
Information and Software Technology
A collection operator for graph transformation
Software and Systems Modeling (SoSyM)
| Hi-index | 0.00 |
In this paper we describe a way to integrate Taentzer's rule amalgamation with the recently proposed notions of nested graph conditions. The resulting so-called quantified graph transformation rules include (universally and existentially) quantified sub-structures in a flexible way. This can be used for instance to specify a larger-step operational semantics, thus improving the scalability of graph transformation as a technique for software verification.