---
res:
bibo_abstract:
- "AbstractIn the field of Model-Driven Engineering,
Triple Graph Grammars\r\n(TGGs) play an important role as a rule-based means of
implementing\r\nconsistency management. From a declarative specification of a\r\nconsistency
relation, several operations including forward and\r\nbackward transformations,
(concurrent) synchronisation, and\r\nconsistency checks can be automatically derived.
For TGGs to be\r\napplicable in realistic application scenarios, expressiveness
in\r\nterms of supported language features is very important. A TGG tool\r\nis
schema compliant if it can take domain constraints, such as\r\nmultiplicity constraints
in a meta-model, into account when\r\nperforming consistency management tasks.
To guarantee schema\r\ncompliance, most TGG tools allow application conditions
to be\r\nattached as necessary to relevant rules. This strategy is\r\nproblematic
for at least two reasons: First, ensuring compliance to\r\na sufficiently expressive
schema for all previously mentioned\r\nderived operations is still an open challenge;
to the best of our\r\nknowledge, all existing TGG tools only support a very restricted\r\nsubset
of application conditions. Second, it is conceptually\r\ndemanding for the user
to indirectly specify domain constraints as\r\napplication conditions, especially
because this has to be completely\r\nrevisited every time the TGG or domain constraint
is changed. While\r\ndomain constraints can in theory be automatically transformed
to\r\nobtain the required set of application conditions, this has only\r\nbeen
successfully transferred to TGGs for a very limited subset of\r\ndomain constraints.
To address these limitations, this paper\r\nproposes a search-based strategy for
achieving schema compliance. We\r\nshow that all correctness and completeness
properties, previously\r\nproven in a setting without domain constraints, still
hold when\r\nschema compliance is to be additionally guaranteed. An\r\nimplementation
and experimental evaluation are provided to support\r\nour claim of practical
applicability.@eng"
bibo_authorlist:
- foaf_Person:
foaf_givenName: Nils
foaf_name: Weidmann, Nils
foaf_surname: Weidmann
foaf_workInfoHomepage: http://www.librecat.org/personId=53103
- foaf_Person:
foaf_givenName: Anthony
foaf_name: Anjorin, Anthony
foaf_surname: Anjorin
bibo_doi: 10.1007/s00165-021-00557-0
dct_date: 2021^xs_gYear
dct_isPartOf:
- http://id.crossref.org/issn/0934-5043
- http://id.crossref.org/issn/1433-299X
dct_language: eng
dct_publisher: Springer@
dct_title: Schema Compliant Consistency Management via Triple Graph Grammars and
Integer Linear Programming@
...