@proceedings {Ujhelyi2016,
	title = {Rete Network Slicing for Model Queries},
	journal = {Graph Transformation: 9th International Conference, ICGT 2016, in Memory of Hartmut Ehrig, Held as Part of STAF 2016, Vienna, Austria, July 5-6, 2016},
	volume = {9761},
	year = {2016},
	month = {06/2016},
	pages = {137{\textendash}152},
	publisher = {Springer International Publishing},
	address = {Vienna, Austria},
	abstract = {<p>
	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.</p>
},
	keywords = {Viatra},
	isbn = {978-3-319-40530-8},
	doi = {10.1007/978-3-319-40530-8_9},
	url = {http://dx.doi.org/10.1007/978-3-319-40530-8_9},
	author = {Zolt{\'a}n Ujhelyi and G{\'a}bor Bergmann and D{\'a}niel Varr{\'o}},
	editor = {Echahed, Rachid and Mark Minas}
}
