Abstract:Despite the wide range of existing tool support, constructing a design environment for a complex domain-specific language (DSL) is still a tedious task as the large number of derived features and well-formedness constraints complementing the domain metamodel necessitate special handling. Such derived features and constraints are frequently defined by declarative techniques (such graph patterns or OCL invariants).However, for complex domains, derived features and constraints can easily be formalized incorrectly… Show more
“…In this paper, domain models are captured by the Eclipse Modeling Framework (EMF) [36], which is frequently used in industrial modeling tools. An extract of metamodel for Yakindu statecharts describing the state graph is illustrated in Figure 2 Metamodel elements are mapped to a set of logic relations as defined in [32,20], which are revisited below:…”
“…Further structural restrictions implied by a metamodel (and formalized in [32]) include (1) Generalization (GEN), which expresses the fact that a more specific (child) class has every structural feature of the more general (parent) class, (2) Type compliance (TC) requires that for any relation R(o, t), its source and target objects o and t need to have compliant types, (3) Abstract (ABS): If a class is defined as abstract, it is not allowed to have direct instances, (4) Multiplicity (MUL) of structural features can be limited with upper and lower bounds in the form of "lower..upper" and (5) Inverse (INV), which states that two parallel references of opposite direction always occur in pairs. Finally EMF instance models are often expected to be arranged into a containment hierarchy, which is a directed tree along references marked in the metamodel as containment (e.g.…”
“…Model M is a valid instance of a metamodel Meta (denoted by M |= Meta) if (i) all classes, references and attributes are defined in Meta and (ii) satisfies the structural constraints (1) − (5) [32].…”
“…Our technique uses the partial snapshots [32] to represent incomplete partial models, and it is compatible with EMF (Eclipse Modeling Framework) [36] which is the de facto industrial modeling standard in MDD. Wellformedness constraints are captured as graph queries using the pattern language of Viatra [4].…”
In modern modeling tools used for model-driven development, the validation of several well-formedness constraints is continuously been carried out by exploiting advanced graph query engines to highlight conceptual design flaws. However, while models are still under development, they are frequently partial and incomplete. Validating constraints on incomplete, partial models may identify a large number of irrelevant problems. By switching off the validation of these constraints, one may fail to reveal problematic cases which are difficult to correct when the model becomes sufficiently detailed.Here, we propose a novel validation technique for evaluating well-formedness constraints on incomplete, partial models with may and must semantics, e.g. a constraint without a valid match is satisfiable if there is a completion of the partial model that may satisfy it. To this end, we map the problem of constraint evaluation over partial models into regular graph pattern matching over complete models by semantically equivalent rewrites of graph queries.
“…In this paper, domain models are captured by the Eclipse Modeling Framework (EMF) [36], which is frequently used in industrial modeling tools. An extract of metamodel for Yakindu statecharts describing the state graph is illustrated in Figure 2 Metamodel elements are mapped to a set of logic relations as defined in [32,20], which are revisited below:…”
“…Further structural restrictions implied by a metamodel (and formalized in [32]) include (1) Generalization (GEN), which expresses the fact that a more specific (child) class has every structural feature of the more general (parent) class, (2) Type compliance (TC) requires that for any relation R(o, t), its source and target objects o and t need to have compliant types, (3) Abstract (ABS): If a class is defined as abstract, it is not allowed to have direct instances, (4) Multiplicity (MUL) of structural features can be limited with upper and lower bounds in the form of "lower..upper" and (5) Inverse (INV), which states that two parallel references of opposite direction always occur in pairs. Finally EMF instance models are often expected to be arranged into a containment hierarchy, which is a directed tree along references marked in the metamodel as containment (e.g.…”
“…Model M is a valid instance of a metamodel Meta (denoted by M |= Meta) if (i) all classes, references and attributes are defined in Meta and (ii) satisfies the structural constraints (1) − (5) [32].…”
“…Our technique uses the partial snapshots [32] to represent incomplete partial models, and it is compatible with EMF (Eclipse Modeling Framework) [36] which is the de facto industrial modeling standard in MDD. Wellformedness constraints are captured as graph queries using the pattern language of Viatra [4].…”
In modern modeling tools used for model-driven development, the validation of several well-formedness constraints is continuously been carried out by exploiting advanced graph query engines to highlight conceptual design flaws. However, while models are still under development, they are frequently partial and incomplete. Validating constraints on incomplete, partial models may identify a large number of irrelevant problems. By switching off the validation of these constraints, one may fail to reveal problematic cases which are difficult to correct when the model becomes sufficiently detailed.Here, we propose a novel validation technique for evaluating well-formedness constraints on incomplete, partial models with may and must semantics, e.g. a constraint without a valid match is satisfiable if there is a completion of the partial model that may satisfy it. To this end, we map the problem of constraint evaluation over partial models into regular graph pattern matching over complete models by semantically equivalent rewrites of graph queries.
“…Viatra tool has similar model checking capabilities [25] and in addition allows the verication of elaborate well-formedness constraints imposed on models [23].…”
Abstract. This paper is concerned with the interplay of the expressiveness of model and graph transformation languages, of assertion formalisms making correctness statements about transformations, and the decidability of the resulting verication problems. We put a particular focus on transformations arising in graph-based knowledge bases and model-driven engineering. We then identify requirements that should be satised by logics dedicated to reasoning about model transformations, and investigate two promising instances which are decidable fragments of rst-order logic.
Verifying ACID compliance is an essential part of database benchmarking, because the integrity of performance results can be undermined as the performance benefits of operating with weaker safety guarantees (at the potential cost of correctness) are well known. Traditionally, benchmarks have specified a number of tests to validate ACID compliance. However, these tests have been formulated in the context of relational database systems and SQL, whereas our scope of benchmarking are systems for graph data, many of which are non-relational. This paper presents a set of data model-agnostic ACID compliance tests for the LDBC (Linked Data Benchmark Council) Social Network Benchmark suite's Interactive (SNB-I) workload, a transaction processing benchmark for graph databases. We test all ACID properties with a particular emphasis on isolation, covering 10 transaction anomalies in total. We present results from implementing the test suite on 5 database systems.(LDBC) [3]. In particular, the LDBC's Social Network Benchmark Interactive workload (SNB-I) was designed to target transactional graph databases [10]. To provide protection against violations of correctness arising from the concurrent execution of transactions and system failures, such transactional databases provide Atomicity, Consistency, Isolation, and Durability (ACID) guarantees. Problem. Verifying ACID compliance is an important step in the benchmarking process for enabling fair comparison between systems. The performance benefits of operating with weaker safety guarantees are well established [13] but this can come at the cost of application correctness. To enable apples vs. apples performance comparisons between systems it is expected they uphold the ACID properties. Currently, LDBC provides no mechanism for validating ACID compliance within the SNB-I workflow. A simple solution would be to outsource the responsibility of demonstrating ACID compliance to benchmark implementors. However, the safety properties claimed by a system often do not match observable behaviour [14].To mitigate this problem, benchmarks such as TPC-C [20] include a number of ACID tests to be executed as part of the benchmarking auditing process. However, we found these tests cannot readily be applied to our context, as they assume lock-based concurrency control and an interactive query API that provides clients with explicit control over a transaction's lifecyle. Modern data systems often use optimistic concurrency control mechanisms [17] and offer a restricted query API, such as only executing transactions as stored procedures [19]. Further, tests that trigger and test row-level locking phenomena, for instance, do not readily map on graph database systems. Lastly, we found these tests are limited in the range of isolation anomalies they cover. Contribution. This paper presents the design of an implementation agnostic ACID compliance test suite for LDBC SNB-I 7 . Our guiding design principle was to be agnostic of system-level implementation details, relying solely on client observations ...
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.