A Graph Query Language for EMF Models

Bergmann, Gábor; Ujhelyi, Zoltán; Ráth, István; Varró, Dániel

doi:10.1007/978-3-642-21732-6_12

Cited by 58 publications

(60 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…attributes and relations calculated from core model elements during model use. In order to illustrate our DSL validation techniques, we use an avionics DSL defined over EMF metamodels and using the language of the EMF-IncQuery [11] framework or OCL to define constraints and derived features over EMF metamodels.…”

Section: Domain Specific Languagesmentioning

confidence: 99%

“…Model queries can be frequently captured by graph patterns (GP) [57,11], which are an expressive formalism used for various purposes in model-driven development alternatively for standard OCL constraints [41]. A graph pattern is a graph-like structure representing a condition (or constraint) matched against a typically large instance model.…”

Section: Model Queriesmentioning

confidence: 99%

“…Figure 3 summarizes the grammar of the language, the complete query language is described in [11], while relevant language features will be introduced on demand in several examples below adapted from [51].…”

Section: Model Queriesmentioning

confidence: 99%

“…The pattern defining the type attribute is illustrated on the right side of Figure 4. We use both a custom graphical and the textual EMF-IncQuery notation [11] to illustrate the queries defined for these derived features. In the graphical notation each rectangle is a variable with a declared type, e.g.…”

Section: Sample Derived Attributementioning

confidence: 99%

See 3 more Smart Citations

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: Domain Specific Languagesmentioning

confidence: 99%

Section: Model Queriesmentioning

confidence: 99%

Section: Model Queriesmentioning

confidence: 99%

Section: Sample Derived Attributementioning

confidence: 99%

See 2 more Smart Citations

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

“…Prolog is untyped and its relational tuple-based structure makes easy the definition of join-based operations, as well as recursive definitions. The success of graph/tuple based languages in constraint specification and validation demonstrates the need for easy to use constraints languages [29,30].…”

Section: Model Transformation and Prologmentioning

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

VAnDroid: A framework for vulnerability analysis of Android applications using a model‐driven reverse engineering technique

2018

View full text Add to dashboard Cite

Summary Android is extensively used worldwide by mobile application developers. Android provides applications with a message passing system to communicate within and between them. Due to the risks associated with this system, it is vital to detect its unsafe operations and potential vulnerabilities. To achieve this goal, a new framework, called VAnDroid, based on Model Driven Reverse Engineering (MDRE), is presented that identifies security risks and vulnerabilities related to the Android application communication model. In the proposed framework, some security‐related information included in an Android app is automatically extracted and represented as a domain‐specific model. Then, it is used for analyzing security configurations and identifying vulnerabilities in the corresponding application. The proposed framework is implemented as an Eclipse‐based tool, which automatically identifies the Intent Spoofing and Unauthorized Intent Receipt as two attacks related to the Android application communication model. To evaluate the tool, it has been applied to several real‐world Android applications, including 20 apps from Google Play and 110 apps from the F‐Droid repository. VAnDroid is also compared with several existing analysis tools, and it is shown that it has a number of key advantages over those tools specifically regarding its high correctness, scalability, and usability in discovering vulnerabilities. The results well indicate the effectiveness and capacity of the VAnDroid as a promising approach in the field of Android security.

show abstract

A Graph Query Language for EMF Models

Cited by 58 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

VAnDroid: A framework for vulnerability analysis of Android applications using a model‐driven reverse engineering technique

Contact Info

Product

Resources

About