Verification of ATL Transformations Using Transformation Models and Model Finders

Büttner, Fabian; Egea, Marina; Cabot, Jordi; Gogolla, Martin

doi:10.1007/978-3-642-34281-3_16

Cited by 63 publications

(94 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…There are several approaches and tools aiming to validate models enriched with OCL constraints [27] relying upon different logic formalisms such as constraint logic programming [17,18,13], SAT-based model finders (like Alloy) [53,3,15,36,54], first-order logic [8], constructive query containment [45], higher-order logic [12,28], or rewriting logics [20]. Some of these approaches (like e.g.…”

Section: Validation Of Ocl Enriched Metamodelsmentioning

confidence: 99%

“…Some of these approaches (like e.g. [18,15,36,53]) offer bounded validation (where the search space needs to be restricted explicitly) in order to execute the validation and thus results can only be considered within the given scope, others (like [12,8]) allow unbounded verification (which normally results in increased level of interaction and decidability issues).…”

Section: Validation Of Ocl Enriched Metamodelsmentioning

confidence: 99%

See 1 more Smart Citation

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

et al. 2015

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: Validation Of Ocl Enriched Metamodelsmentioning

confidence: 99%

Section: Validation Of Ocl Enriched Metamodelsmentioning

confidence: 99%

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

et al. 2015

View full text Add to dashboard Cite

show abstract

“…At present, the verification of ATL transformations in FMA-ATL is based on bounded model checking against contracts, which can be written in OCL, from a given source model. Focussing on other bounded model checking approaches, [6] the semantics of ATL transformations is captured in ATL transformation models using OCL constraints and reduces the verification of their partial correctness to a satisfiability problem in Alloy.…”

Section: Experimentationmentioning

confidence: 99%

Experimentation with a Big-Step Semantics for ATL Model Transformations

Boronat

2017

Theory and Practice of Model Transformation

View full text Add to dashboard Cite

Abstract. Formal semantics is a convenient tool to equip a model transformation language with precise meaning for its model transformations. Hence, clarifying their usage in complex scenarios and helping in the development of robust model transformation engines. In this paper, we focus on the formal specification of a model transformation engine for the declarative part of ATL. We present an implementation-agnostic, big-step, structural operational semantics for ATL transformation rules and a rule scheduler, which form the specification of an interpreter for ATL. Hence, avoiding a complex compilation phase. The resulting semantics for rules enjoys a compositional nature and we illustrate its advantages by reusing an interpreter for OCL. The semantics discussed has been validated with the implementation of an interpreter in Maude, enabling the execution of model transformations and their formal analysis using Maude's toolkit. We also present an evaluation of the interpreter's performance and scalability.

show abstract

“…ATL transformations are translated in [6] to a transformation model with suitable constraints expressing the ATL semantics and in [16] to a Maude specification with a rewriting logic arguably similar to our graph rewriting transformation. The analyses made possible by these and other formalisations include Hoare-style correctness analyses, i.e.…”

Section: Related Workmentioning

confidence: 99%

“…This includes test generation [9] and verification of correctness properties [6,16] through translations of ATL to other analyzable specifications. However we are interested in an analysis that is not possible with existing formalisations of ATL: the construction of Weakest Precondition (WP) [10].…”

Section: Introductionmentioning

confidence: 99%

Translating ATL Model Transformations to Algebraic Graph Transformations

Richa

Borde

Pautet

2015

Theory and Practice of Model Transformations

View full text Add to dashboard Cite

Abstract. Analyzing and reasoning on model transformations has become very relevant for various applications such as ensuring the correctness of transformations. ATL is a model transformation language with rich semantics and a focus on usability, making its analysis not straightforward. Conversely, Algebraic Graph Transformation (AGT) is an approach with strong theoretical foundations allowing for formal analyses that would be valuable in the context of ATL. In this paper we propose a translation of ATL to the AGT framework in the objective of bringing theoretical analyses of AGT to ATL transformations. We validate our proposal by translating a set of feature-rich ATL transformations to the Henshin AGT framework. We execute the ATL and AGT versions on the same set of models and verify that the result is the same.

show abstract

Verification of ATL Transformations Using Transformation Models and Model Finders

Cited by 63 publications

References 23 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

Experimentation with a Big-Step Semantics for ATL Model Transformations

Translating ATL Model Transformations to Algebraic Graph Transformations

Contact Info

Product

Resources

About