When developing domain-specific modeling languages (DSMLs), software engineers have to make a number of important design decisions on the DSML itself, or on the software-development process that is applied to develop the DSML. Thus, making well-informed design decisions is a critical factor in developing DSMLs. To support this decision-making process, the model-driven development community has started to collect established design practices in terms of patterns, guidelines, story-telling, and procedural models. However, most of these documentation practices do not capture the details necessary to reuse the rationale behind these decisions in other DSML projects. In this paper, we report on a three-year research effort to compile and to empirically validate a catalog of structured decision descriptions (decision records) for UML-based DSMLs. This catalog is based on design decisions extracted from 90 DSML projects. These projects were identified - among others - via an extensive systematic literature review (SLR) for the years 2005 - 2012. Based on more than 8,000 candidate publications, we finally selected 84 publications for extracting design-decision data. The extracted data were evaluated quantitatively using a frequent-item-set analysis to obtain characteristic combinations of design decisions and qualitatively to document recurring documentation issues for UML-based DSMLs. We revised the collected decision records based on this evidence and made the decision-record catalog for developing UML-based DSMLs publicly available. Furthermore, our study offers insights into UML usage (e.g. diagram types) and into the adoption of UML extension techniques (e.g. metamodel extensions, profiles).

<p>U sklopu doktorske disertacije izvršeno je istraživanje vezano za automatsko<br />raspoređivanje elemenata dijagrama. Kroz analizu postojećih rešenja uočen je<br />prostor za poboljšanja, posebno po pitanju raznovrsnosti dostupnih algoritama<br />i pomoći korisniku pri izboru najpogodnijeg od njih. U okviru istraživanja<br />proučavan, implementiran i u pojedinim slučajevima unapređen je širok<br />spektar algoritama za crtanje i analizu grafova. Definisan je postupak<br />automatskog izbora odgovarajućeg algoritma za raspoređivanje elemenata<br />grafova na osnovu njihovih osobina. Dodatno, osmišljen je jezik specifičan za<br />domen koji korisnicima grafičkih editora pruža pomoć u izboru algoritma za<br />raspoređivanje, a programerima brže pisanje koda za poziv željenog algoritma.</p> / <p>This thesis presents a research aimed towards the problem of automatically<br />laying out elements of a diagram. The analysis of existing solutions showed that there<br />is some room for improvement, especially regarding variety of available algorithms.<br />Also, none of the solutions offer possibility of automatically choosing an appropriate<br />graph layout algorithm. Within the research, a large number of different algorithms for<br />graph drawing and analysis were studied, implemented, and, in some cases,<br />enhanced. A method for automatically choosing the best available layout algorithm<br />based on properties of a graph was defined. Additionally, a domain-specific language<br />for specifying a graph&rsquo;s layout was designed.</p>

<p>Software verification is an important part of software development and themost practical way to do this today is through dynamic testing. This reportexplains concepts connected to verification and testing and also presents thetesting-framework Trassel developed during the writing of this report.Constructing domain specific languages and tools by using an existinglanguage as a starting ground can be a good strategy for solving certainproblems, this was tried with Trassel where the description-language forwriting test-cases was written as a DSL using Python as the host-language.</p>

Les travaux présentés dans cette thèse visent à faciliter le développement de ressources pour le traitement automatique des langues. Les ressources de ce type prennent des formes très diverses, en raison de l’existence de différents niveaux d’étude de la langue (syntaxe, morphologie, sémantique,. . . ) et de différents formalismes proposés pour la description des langues à chacun de ces niveaux. Les formalismes faisant intervenir différents types de structures, un unique langage de description n’est pas suffisant : il est nécessaire pour chaque formalisme de créer un langage dédié (ou DSL), et d’implémenter un nouvel outil utilisant ce langage, ce qui est une tâche longue et complexe. Pour cette raison, nous proposons dans cette thèse une méthode pour assembler modulairement, et adapter, des cadres de développement spécifiques à des tâches de génération de ressources langagières. Les cadres de développement créés sont construits autour des concepts fondamentaux de l’approche XMG (eXtensible MetaGrammar), à savoir disposer d’un langage de description permettant la définition modulaire d’abstractions sur des structures linguistiques, ainsi que leur combinaison non-déterministe (c’est à dire au moyen des opérateurs logiques de conjonction et disjonction). La méthode se base sur l’assemblage d’un langage de description à partir de briques réutilisables, et d’après un fichier unique de spécification. L’intégralité de la chaîne de traitement pour le DSL ainsi défini est assemblée automatiquement d’après cette même spécification. Nous avons dans un premier temps validé cette approche en recréant l’outil XMG à partir de briques élémentaires. Des collaborations avec des linguistes nous ont également amené à assembler des compilateurs permettant la description de la morphologie de l’Ikota (langue bantoue) et de la sémantique (au moyen de la théorie des frames). / The work presented in this thesis aim at facilitating the development of resources for natural language processing. Resources of this type take different forms, because of the existence of several levels of linguistic description (syntax, morphology, semantics, . . . ) and of several formalisms proposed for the description of natural languages at each one of these levels. The formalisms featuring different types of structures, a unique description language is not enough: it is necessary to create a domain specific language (or DSL) for every formalism, and to implement a new tool which uses this language, which is a long a complex task. For this reason, we propose in this thesis a method to assemble in a modular way development frameworks specific to tasks of linguistic resource generation. The frameworks assembled thanks to our method are based on the fundamental concepts of the XMG (eXtensible MetaGrammar) approach, allowing the generation of tree based grammars. The method is based on the assembling of a description language from reusable bricks, and according to a unique specification file. The totality of the processing chain for the DSL is automatically assembled thanks to the same specification. In a first time, we validated this approach by recreating the XMG tool from elementary bricks. Some collaborations with linguists also brought us to assemble compilers allowing the description of morphology and semantics.

Today it is realized by industry that automation of software development leads to increased productivity, maintainability and higher quality. Model-Driven Development (MDD) aims to replace manual software development methods by automated methods using Domain-Specific Languages (DSLs) to express domain concepts effectively. Main actors in software industry, Microsoft and IBM have recognized the need to provide technologies and tools to allow building DSLs to support MDD. On the one hand, Microsoft is building DSL Tools integrated in Visual Studio 2005; on the other hand IBM is contributing to the development of Eclipse Modeling Frameworks (EMF/GEF/GMF), both tools aim to make development and deployment of DSLs easier. Software practitioners seek for guidelines regarding how to adopt these tools. In this thesis, the author presents the current state-of-the-art in MDD standards and Domain-Specific Modeling (DSM). Furthermore, the author presents current state-of-the-tools for DSM and performs a comparison of Microsoft DSL Tools and Eclipse EMF/GEF/GMF Frameworks based on a set of evaluation criteria. For the purpose of comparison the author developed two DSL designers (one by using each DSM tool). Based on the experiences gained in development of these DSL designers, the author prepared guidelines regarding how to adopt these tools to existing development environments as well as their advantages and drawbacks.

Enterprise portals are comprehensive solutions that enable centralized access to information and employees. They also support the business processes taking place in companies. The diversity of functionality offered by enterprise portals is the source of the complexity of the manufacturing process of such applications. Domain-Specific Languages (DSL) are a novel approach to solving problems associated with the software development. By limiting the possibilities of expression to the concepts related to a specific area Domain-Specific Languages are more focused on solving specific problems. The subject of this thesis is DSL SharePoint – Domain-Specific Language which supports the production of enterprise portals on Microsoft SharePoint platform. Language was developed with respect to the newest achievements in area of building DSLs. By applying the language in the industry, it was possible to verify the hypothesis that its usage positively affects the quality of software products. To this end, the quality model was built, and products made with the support of language have been compared to those developed in the traditional manner.

Software verification is an important part of software development and themost practical way to do this today is through dynamic testing. This reportexplains concepts connected to verification and testing and also presents thetesting-framework Trassel developed during the writing of this report.Constructing domain specific languages and tools by using an existinglanguage as a starting ground can be a good strategy for solving certainproblems, this was tried with Trassel where the description-language forwriting test-cases was written as a DSL using Python as the host-language.

Domain specific languages are sometimes useful to make it easier to express solutions to problems in a specific domain compared to general purpose programming languages. There are a number of tools available to create such languages, either as separate languages or by extending an existing language. One large problem with creating languages or language extensions is that existing tools are unaware of the new language, and therefore unable to properly assist the programmer unless all such tools are extended to support the new language. Extending all tools to support the new language is often a large enough task to be infeasible, especially for small languages. In this thesis, we propose using the compiler of the extensible language Storm to provide the information required for a text editor to provide syntax highlighting and code formatting. By using the Storm compiler to provide the required information, it is possible to use the Storm language definitions for syntax highlighting and code formatting in addition to compiling the language. This means that syntax highlighting and code formatting can be provided without requiring the language author to maintain multiple implementations of the language. The solution is evaluated by comparing the correctness and the responsiveness of the syntax highlighting to Emacs.

No description available.

The ideals of exact modeling, and of putting off approximations as long as possible, make Bayesian practice both successful and difficult. Languages for modeling probabilistic processes, whose implementations answer questions about them under asserted conditions, promise to ease much of the difficulty. Unfortunately, very few of these languages have mathematical specifications. This makes them difficult to trust: there is no way to distinguish between an implementation error and a feature, and there is no standard by which to prove optimizations correct. Further, because the languages are based on the incomplete theories of probability typically used in Bayesian practice, they place seemingly artificial restrictions on legal programs and questions, such as disallowing unbounded recursion and allowing only simple equality conditions. We prove it is possible to make trustworthy probabilistic languages for Bayesian practice by using functional programming theory to define them mathematically and prove them correct. The specifications interpret programs using measure-theoretic probability, which is a complete enough theory of probability that we do not need to restrict programs or conditions. We demonstrate that these trustworthy languages are useful by implementing them, and using them to model and answer questions about typical probabilistic processes. We also model and answer questions about processes that are either difficult or impossible to reason about precisely using typical Bayesian mathematical tools.