In recent years program transformation technology has matured into a practical solution for many software reengineering and migration tasks. FermaT, an industrial strength program transformation system, has demonstrated that legacy systems can be successfully transformed into efficient and maintainable structured C or COBOL code. Its core, a transformation engine, is based on mathematically proven program transformations and ensures that transformed programs are semantically equivalent to its original state. Its engine facilitates a Wide Spectrum Language (WSL), with low-level as well as high-level constructs, to capture as much information as possible during transformation steps. FermaT’s methodology and technique lack in provision of concurrent migration and analysis. This provision is crucial if the transformation process is to be further automated. As the constraint based program migration theory has demonstrated, it is inefficient and time consuming, trying to satisfy the enormous computation of the generated transformation sequence search-space and its constraints. With the objective to solve the above problems and to extend the operating range of the FermaT transformation system, this thesis proposes a Parallel Transformations Framework which makes parallel transformations processing within the FermaT environment not only possible but also beneficial for its migration process. During a migration process, many thousands of program transformations have to be applied. For example a 1 million line of assembler to C migration takes over 21 hours to be processed on a single PC. Various approaches of search, prediction techniques and a constraint-based approach to address the presented issues already exist but they solve them unsatisfactorily. To remedy this situation, this dissertation proposes a framework to extend transformation processing systems with parallel processing capabilities. The parallel system can analyse specified parallel transformation tasks and produce appropriate parallel transformations processing outlines. To underpin an automated objective, a formal language is introduced. This language can be utilised to describe and outline parallel transformation tasks whereas parallel processing constraints underpin the parallel objective. This thesis addresses and explains how transformation processing steps can be automatically parallelised within a reengineering domain. It presents search and prediction tactics within this field. The decomposition and parallelisation of transformation sequence search-spaces is outlined. At the end, the presented work is evaluated on practical case studies, to demonstrate different parallel transformations processing techniques and conclusions are drawn.

Made available in DSpace on 2014-12-17T14:56:21Z (GMT). No. of bitstreams: 1 HertzWCL.pdf: 1101364 bytes, checksum: 81e217f795557edb8c6aa671cd62dabf (MD5) Previous issue date: 2006-10-06 / Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior / This work presents the specification and the implementation of a language of Transformations in definite Models specification MOF (Meta Object Facility) of OMG (Object Management Group). The specification uses a boarding based on rules ECA (Event-Condition-Action) and was made on the basis of a set of scenes of use previously defined. The Parser Responsible parser for guaranteeing that the syntactic structure of the language is correct was constructed with the tool JavaCC (Java Compiler Compiler) and the description of the syntax of the language was made with EBNF (Extended Backus-Naur Form). The implementation is divided in three parts: the creation of the interpretative program properly said in Java, the creation of an executor of the actions specified in the language and its integration with the type of considered repository (generated for tool DSTC dMOF). A final prototype was developed and tested in the scenes previously defined / Este trabalho apresenta a especifica??o e a implementa??o de uma linguagem de Transforma??es em Modelos definidos segundo a especifica??o MOF (Meta Object Facility) da OMG (Object Management Group). A especifica??o utiliza uma abordagem baseada em regras ECA (Event-Condition-Action) e foi feita com base em um conjunto de cen?rios de uso previamente definidos. O parser respons?vel por garantir que a estrutura sint?tica da linguagem est? correta foi constru?do com a ferramenta JavaCC (Java Compiler Compiler) e a descri??o da sintaxe da linguagem foi feita com EBNF (Extended Backus-Naur Form). A implementa??o est? dividida em tr?s partes: a cria??o do programa interpretador propriamente dito em Java, a cria??o de um executor das a??es especificadas na linguagem e sua integra??o com o tipo de reposit?rio considerado (gerados pela ferramenta DSTC dMOF). Um prot?tipo final foi desenvolvido e testado nos cen?rios previamente definidos