Automatically Discovering Hidden Transformation Chaining Constraints

Model transformations operate on models conforming to precisely defined metamodels. Consequently, it often seems relatively easy to chain them: the output of a transformation may be given as input to a second one if metamodels match. However, this simple rule has some obvious limitations. For instance, a transformation may only use a subset of a metamodel. Therefore, chaining transformations appropriately requires more information. We present here an approach that automatically discovers more detailed information about actual chaining constraints by statically analyzing transformations. The objective is to provide developers who decide to chain transformations with more data on which to base their choices. This approach has been successfully applied to the case of a library of endogenous transformations. They all have the same source and target metamodel but have some hidden chaining constraints. In such a case, the simple metamodel matching rule given above does not provide any useful information

On hyperbolic fixed points in ultrametric dynamics

Let K be a complete ultrametric field. We give lower and upper bounds for the size of linearization discs for power series over K near hyperbolic fixed points. These estimates are maximal in the sense that there exist examples where these estimates give the exact size of the corresponding linearization disc. In particular, at repelling fixed points, the linearization disc is equal to the maximal disc on which the power series is injective.Comment: http://www.springerlink.com/content/?k=doi%3a%2810.1134%2fS2070046610030052%2

Traceability for Mutation Analysis in Model Transformation

International audienceModel transformation can't be directly tested using program techniques. Those have to be adapted to model characteristics. In this paper we focus on one test technique: mutation analysis. This technique aims to qualify a test data set by analyzing the execution results of intentionally faulty program versions. If the degree of qualification is not satisfactory, the test data set has to be improved. In the context of model, this step is currently relatively fastidious and manually performed. We propose an approach based on traceability mechanisms in order to ease the test model set improvement in the mutation analysis process. We illustrate with a benchmark the quick automatic identification of the input model to change. A new model is then created in order to raise the quality of the test data set

An invariant-based method for the analysis of declarative model-to-model transformations

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-540-87875-9_3Proceedings of 11th International Conference, MoDELS 2008, Toulouse, France, September 28 - October 3, 2008In this paper we propose a method to derive OCL invariants from declarative specifications of model-to-model transformations. In particular we consider two of the most prominent approaches for specifying such transformations: Triple Graph Grammars and QVT. Once the specification is expressed in the form of invariants, the transformation developer can use such description to verify properties of the original transformation (e.g. whether it defines a total, surjective or injective function), and to validate the transformation by the automatic generation of valid pairs of source and target models.Work supported by the Spanish Ministry of Education and Science, projects MOSAIC (TSI2005-08225-C07-06), MODUWEB (TIN2006-09678) and TIN2005-06053, and an UOC-IN3 research gran

A formal framework to prove the correctness of model driven engineering composition operators

International audienceCurrent trends in system engineering combine modeling, composition and verification technologies in order to harness their ever growing complexity. Each composition operator dedicated to a different modeling concern should be proven to be property preserving at assembly time. These proofs are usually burdensome with repetitive aspects. Our work targets the factorisation of these aspects relying on primitive generic composition operators used to express more sophisticated language specific ones. These operators are defined for languages expressed with OMG MOF metamodeling technologies. The proof are done with the Coq proof assistant relying on the Coq4MDE framework defined previously. These basic operators, Union and Substitution, are illustrated using the MOF Package Merge as composition operator and the preservation of model conformance as verified property

Computing the NN-th Term of a qq-Holonomic Sequence

International audienceIn 1977, Strassen invented a famous baby-step / giant-step algorithm that computes the factorial $N!$ in arithmetic complexity quasi-linear in $\sqrt{N}$. In 1988, the Chudnovsky brothers generalized Strassen’s algorithm to the computation of the $N$-th term of any holonomic sequence in the same arithmetic complexity. We design $q$-analogues of these algorithms. We first extend Strassen’s algorithm to the computation of the $q$-factorial of $N$, then Chudnovskys' algorithm to the computation of the $N$-th term of any $q$-holonomic sequence. Both algorithms work in arithmetic complexity quasi-linear in~$\sqrt{N}$. We describe various algorithmic consequences, including the acceleration of polynomial and rational solving of linear $q$-differential equations, and the fast evaluation of large classes of polynomials, including a family recently considered by Nogneng and Schost

Linearization in ultrametric dynamics in fields of characteristic zero - equal characteristic case

Let $K$ be a complete ultrametric field of charactersitic zero whose corresponding residue field $\Bbbk$ is also of charactersitic zero. We give lower and upper bounds for the size of linearization disks for power series over $K$ near an indifferent fixed point. These estimates are maximal in the sense that there exist exemples where these estimates give the exact size of the corresponding linearization disc. Similar estimates in the remaning cases, i.e. the cases in which $K$ is either a $p$-adic field or a field of prime characteristic, were obtained in various papers on the $p$-adic case (Ben-Menahem:1988,Thiran/EtAL:1989,Pettigrew/Roberts/Vivaldi:2001,Khrennikov:2001) later generalized in (Lindahl:2009 arXiv:0910.3312), and in (Lindahl:2004 http://iopscience.iop.org/0951-7715/17/3/001/,Lindahl:2010Contemp. Math) concerning the prime characteristic case