Incremental Evaluation of Model Queries over EMF Models

Bergmann, Gábor; Horváth, Ákos; Ráth, István; Varró, Dániel; Balogh, András; Balogh, Zoltán; Ökrös, András

doi:10.1007/978-3-642-16145-2_6

Cited by 69 publications

(64 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…to enhance modeling for domain experts. Furthermore, there is efficient tool support for validating well-formedness constraints and design rules over large model instances of the DSL using tools like Eclipse OCL [58] or EMF-IncQuery [10]. As a result, Eclipse-based IDEs are widely used in the industry in various domains including business modeling, avionics or automotive.…”

Section: Towards Validation Of Domain-specific Languagesmentioning

confidence: 99%

Formal validation of domain-specific languages with derived features and well-formedness constraints

et al. 2015

Self Cite

View full text Add to dashboard Cite

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 resulting in inconsistent, incomplete or ambiguous DSL specifications. To detect such issues, we propose an automated mapping of EMF metamodels enriched with derived features and well-formedness constraints captured as graph queries in EMF-IncQuery or (a subset of) OCL invariants into an effectively propositional fragment of first-order logic which can be efficiently analyzed by back-end reasoners.On the conceptual level, the main added value of our encoding is (1) to transform graph patterns of the EMF-IncQuery framework into FOL and (2) to introduce approximations for complex language features (e.g. transitive closure or multiplicities) which are not expressible in FOL. On the practical level, we identify and address relevant challenges and scenarios for systematically validating DSL specifications. Our approach is supported by a tool and it will be illustrated on analyzing a DSL in the avionics domain. We also present initial performance experiments for the validation using Z3 and Alloy as back-end reasoners.

show abstract

Section: Towards Validation Of Domain-specific Languagesmentioning

confidence: 99%

Formal validation of domain-specific languages with derived features and well-formedness constraints

et al. 2015

Self Cite

View full text Add to dashboard Cite

show abstract

“…EMF-IncQuery has a syntax similar to Prolog goals to express constraints. Incremental validation of constraints has been studied for EMF-IncQuery [59,71], which is considered as future work.…”

Section: Constraint Validationmentioning

confidence: 99%

PTL: A model transformation language based on logic programming

Almendros-Jiménez¹,

Iribarne²,

López-Fernández³

et al. 2016

Journal of Logical and Algebraic Methods in Programming

View full text Add to dashboard Cite

In this paper we present a model transformation language based on logic programming. The language, called PTL (Prolog based Transformation Language), can be considered as a hybrid language in which ATL (Atlas Transformation Language)-style rules are combined with logic rules for defining transformations. ATL-style rules are used to define mappings from source models to target models while logic rules are used as helpers. The implementation of PTL is based on the encoding of the ATL-style rules by Prolog rules. Thus, PTL makes use of Prolog as a transformation engine. We have provided a declarative semantics to PTL and proved the semantics equivalent to the encoded program. We have studied an encoding of OCL (Object Constraint Language) with Prolog goals in order to map ATL to PTL. Thus a subset of PTL can be considered equivalent to a subset of ATL. The proposed language can be also used for model validation, that is, for checking constraints on models and transformations. We have equipped our language with debugging and tracing capabilities which help developers to detect programming errors in PTL rules. Additionally, we have developed an Eclipse plugin for editing PTL programs, as well as for debugging, tracing and validation. Finally, we have evaluated the language with several transformation examples as well as tested the performance with large models.

show abstract

“…This makes the results available at any time without further searching, however, the cache needs to be incrementally updated whenever changes are made to the model. The Rete algorithm [14], which is well-known in rulebased systems, was efficiently adapted to several incremental pattern matchers [15]- [17]. The algorithm relies on a network of nodes to store partial matches of a graph pattern that enumerate the model elements that satisfy a subset of the graph pattern constraints.…”

Section: B Definition Of Model Queries Using Graph Patternsmentioning

confidence: 99%

Anti-pattern detection with model queries: A comparison of approaches

Ujhelyi

Horváth

Varró

et al. 2014

2014 Software Evolution Week - IEEE Conference on Software Maintenance, Reengineering, and Reverse Engineering (CSMR-WCRE)

View full text Add to dashboard Cite

Abstract-Program queries play an important role in several software evolution tasks like program comprehension, impact analysis, or the automated identification of anti-patterns for complex refactoring operations. A central artifact of these tasks is the reverse engineered program model built up from the source code (usually an Abstract Semantic Graph, ASG), which is traditionally post-processed by dedicated, hand-coded queries. Our paper investigates the use of the popular industrial Eclipse Modeling Framework (EMF) as an underlying representation of program models processed by three general-purpose model query techniques based on native Java code, local-search and incremental evaluation. We provide in-depth comparison of these techniques on the source code of 17 Java projects using queries taken from refactoring operations in different usage profiles. Our results show that general purpose model queries outperform hand-coded queries by 2-3 orders of magnitude, while there is a 5-10 times increase in memory consumption and model load time. In addition, measurement results of usage profiles can be used as guidelines for selecting the appropriate query technologies in concrete scenarios.

show abstract

Incremental Evaluation of Model Queries over EMF Models

Cited by 69 publications

References 11 publications

Formal validation of domain-specific languages with derived features and well-formedness constraints

Formal validation of domain-specific languages with derived features and well-formedness constraints

PTL: A model transformation language based on logic programming

Anti-pattern detection with model queries: A comparison of approaches

Contact Info

Product

Resources

About