A Study on Model Transformation Mechanism Using Graph Comparison Algorithm, Abstract Factory Pattern and Bridge Pattern

2011 ◽  
Vol 121-126 ◽  
pp. 2476-2481
Author(s):  
Jong Won Ko ◽  
Young Jae Song

In order to easily port mobile applications suitable for each platform, that have been developed under diverse development environment for individual wireless communication service providers, or redevelop them on a specific platform, it is required to reuse them at software model level that is a software development paradigm for MDA (Model Driven Architecture). Verification of existing design models and test models for the study, mainly checking (Model Checking) with a code-based software designed to define in the abstract syntax tree or on the models generated using refactoring on design models for refinery operations and define how to perform. The problem with these traditional research methods, but the first model, design model for checking the information with the model by defining a formal representation in the form of an abstract syntax tree, as you've shown how to perform verification of the model to perform refactoring. Additional steps need to define more complex due to a software problem that is not the way to the model suitable for optimization refactoring. In this paper, as defined in the MDA-based model transformation studies of a reusable model transformation patterns, abstract factory pattern and the bridge pattern given the pattern information automatically through the software model offers a way to perform refactoring..

2012 ◽  
Vol 224 ◽  
pp. 69-72
Author(s):  
Jong Won Ko

Validation of existing software design models and transformed target models for the study, mainly checking (Model Checking) with a code-based software designed to define in the abstract syntax tree or on the models generated using refactoring on design models for refinery operations and define how to perform. The problem with these traditional research methods, but the first model, design model for checking the information with the model by defining a formal representation in the form of an abstract syntax tree, as you've shown how to perform validation of UML design model. Additional steps need to define more complex due to a software problem that is not the way to the model suitable for model transformation verification. In this paper, as defined in the MDA based model transformation studies of a graph based mode transformation, and how to perform model transformation verification through improving graph comparison algorithm and model property information.


Author(s):  
Luís Eduardo de Souza Amorim ◽  
Eelco Visser

Abstract SDF3 is a syntax definition formalism that extends plain context-free grammars with features such as constructor declarations, declarative disambiguation rules, character-level grammars, permissive syntax, layout constraints, formatting templates, placeholder syntax, and modular composition. These features support the multi-purpose interpretation of syntax definitions, including derivation of type schemas for abstract syntax tree representations, scannerless generalized parsing of the full class of context-free grammars, error recovery, layout-sensitive parsing, parenthesization and formatting, and syntactic completion. This paper gives a high level overview of SDF3 by means of examples and provides a guide to the literature for further details.


2017 ◽  
Vol 2017 ◽  
pp. 1-8 ◽  
Author(s):  
Deqiang Fu ◽  
Yanyan Xu ◽  
Haoran Yu ◽  
Boyang Yang

In this paper, we introduce a source code plagiarism detection method, named WASTK (Weighted Abstract Syntax Tree Kernel), for computer science education. Different from other plagiarism detection methods, WASTK takes some aspects other than the similarity between programs into account. WASTK firstly transfers the source code of a program to an abstract syntax tree and then gets the similarity by calculating the tree kernel of two abstract syntax trees. To avoid misjudgment caused by trivial code snippets or frameworks given by instructors, an idea similar to TF-IDF (Term Frequency-Inverse Document Frequency) in the field of information retrieval is applied. Each node in an abstract syntax tree is assigned a weight by TF-IDF. WASTK is evaluated on different datasets and, as a result, performs much better than other popular methods like Sim and JPlag.


Sign in / Sign up

Export Citation Format

Share Document