Citation Context

...ilar to OCL. In the second group, [26], provides a rewriting logic semantics for ATL, and uses Maude to simulate and verify transformations. In the same logic, [7] formalizes QVTlike transformations. =-=[1,4]-=- translate pattern-based model-transformations into the relational logic of Alloy. In [6] they extend a verification technique capable of checking statically that graph based refactoring rule applicat...

Citation Context

...to be resolved by type checking and filtering conditions resolution. Also, we deal with more complex bindings statements in the output patterns for this transformation. This example was borrowed from =-=[5]-=-. Organization. In Sect. 2 we present our running example. Sect. 3 and Sect. 4 describe our FOL formalization for metamodels and ATL rules. In Sect. 5 we formalize our Hoare-style notion of partial co...

Citation Context

...ilar to OCL. In the second group, [26], provides a rewriting logic semantics for ATL, and uses Maude to simulate and verify transformations. In the same logic, [7] formalizes QVTlike transformations. =-=[1,4]-=- translate pattern-based model-transformations into the relational logic of Alloy. In [6] they extend a verification technique capable of checking statically that graph based refactoring rule applicat...

Citation Context

...th ATL or with a constraint language similar to OCL. In the second group, [26], provides a rewriting logic semantics for ATL, and uses Maude to simulate and verify transformations. In the same logic, =-=[7]-=- formalizes QVTlike transformations. [1,4] translate pattern-based model-transformations into the relational logic of Alloy. In [6] they extend a verification technique capable of checking statically ...

Citation Context

...ONA solver. Only the typing of the graph can be checked in this approach. Other properties, e.g., the uniqueness of names, cannot be expressed in this approach while they can be checked using OCL. In =-=[2]-=-, they propose novel deduction rules to be used for automatically deriving properties of model transformations. On the contrary, we do not propose new deduction rules but rely on the deduction systems...

Citation Context

...specify a maximum model extent. Nevertheless, we think that tools specially dedicated to finite model finding such as Alloy are better suited to perform exactly that task in less time. Our experience =-=[9]-=- leads us in this direction also, and we consider a matter of future work tailoring our semantics for these tools. They would provide the required complement to SMT solvers, for the satisfiable case. ...

Citation Context

...ses Maude to simulate and verify transformations. In the same logic, [7] formalizes QVTlike transformations. [1,4] translate pattern-based model-transformations into the relational logic of Alloy. In =-=[6]-=- they extend a verification technique capable of checking statically that graph based refactoring rule applications preserve consistency with regards to graph constraints by automatically performing c...