Rete Network Slicing for Model Queries

TitleRete Network Slicing for Model Queries
Publication TypeConference Proceedings
Year of Publication2016
AuthorsUjhelyi, Z., Bergmann, G., and Varró, D.
EditorEchahed, R., and Minas, M.
Conference NameGraph Transformation: 9th International Conference, ICGT 2016, in Memory of Hartmut Ehrig, Held as Part of STAF 2016, Vienna, Austria, July 5-6, 2016
Series TitleLecture Notes in Computer Science
Date Published06/2016
PublisherSpringer International Publishing
Conference LocationVienna, Austria
ISBN Number978-3-319-40530-8

Declarative model queries captured by graph patterns are frequently used in model driven engineering tools for the validation of well-formedness constraint or the calculation of various model metrics. However, their high level nature might make it hard to understand all corner cases of complex queries. When debugging erroneous patterns, a common task is to identify which conditions or constraints of a query caused some model elements to appear in the results. Slicing techniques in traditional programming environments are used to calculate similar dependencies between program statements. Here, we introduce a slicing approach for model queries based on Rete networks, a cache structure applied for the incremental evaluation of model queries. The proposed method reuses the structural information encoded in the Rete networks to calculate and present a trace of operations resulting in some model elements to appear in the result set. The approach is illustrated on a running example of validating well-formedness over UML state machine models using graph patterns as a model query formalism.