"Because many software systems used for business today are considered legacy systems, the need for software evolution techniques has never been greater. We propose a novel evolution methodology for legacy systems that integrates the concepts of features, regression testing, and Component-Based Software Engineering (CBSE). Regression test suites are untapped resources that contain important information about the features of a software system. By exercising each feature with its associated test cases using code profilers and similar tools, code can be located and refactored to create components. The unique combination of Feature Engineering and CBSE makes it possible for a legacy system to be modernized quickly and affordably. We develop a new framework to evolve legacy software that maps the features to software components refactored from their feature implementation. In this dissertation, we make the following contributions: First, a new methodology to evolve legacy code is developed that improves the maintainability of evolved legacy systems. Second, the technique describes a clear understanding between features and functionality, and relationships among features using our feature model. Third, the methodology provides guidelines to construct feature-based reusable components using our fine-grained component model. Fourth, we bridge the complexity gap by identifying feature-based test cases and developing feature-based reusable components. We show how to reuse existing tools to aid the evolution of legacy systems rather than re-writing special purpose tools for program slicing and requirement management. We have validated our approach on the evolution of a real-world legacy system. By applying this methodology, American Financial Systems, Inc. (AFS), has successfully restructured its enterprise legacy system and reduced the costs of future maintenance. "

Flow induced self-oscillations cause acoustic pressure oscillations of large amplitude in pipe flows. If Reynolds number is treated as a parameter, these floinduced oscillations occur only at discrete and critical values of Reynolds number. However, for a small range of Reynolds numbers around such a critical value, such periodic oscillations may appear intermittently. If intermittency, which is a precursor to these self-oscillations, can be detected, prediction of an impending instability may be possible. In experiments done by Vineeth and Sujith (Int. J. Aeroacoustics, 2016) on flow in a duct orifice arrangement, where flow enters through the duct inlet, and leaves into the atmosphere through the orifice exit, “whistling” was observed at a Reynolds number of 4200 (based on the orifice thickness and flow speed within the orifice), where large amplitude pressure oscillations were observed. At slightly lower Reynolds numbers, bursts of relatively smaller amplitudes of pressure oscillations were observed to appear intermittently. For a similar configuration, Large Eddy Simulations (LES) have been carried out with explicit filtering as a sub­ grid scale model here. Both whistling and intermittency are observed in the simulations. As air flows from the duct into the orifice, it turns sharply around the corner at the duct­ orifice interface. Due to this sharp turn, flow separation occurs, and hence, a shear layer is formed at the mouth of the orifice. The mechanism of whistling is found to be this shear layer within the orifice flapping about and hitting the trailing edge of the orifice periodically, thus causing the shear layer to break and roll up into a vortex. At Reynolds numbers where intermittency is observed, the shear layer is found to very mildly come in contact with the edges of the orifice walls, thus disturbing it. In the simulations, time series data of pressure are recorded at various probe locations. In a given time series, if scale invariance behaviour exists, it can be quantified by measuring the Hurst exponent. The numerical value of the Hurst exponent is an index of “long range or short range dependence” in a time series. Hurst exponent is measured in the time series data obtained. It is found to drop to zero as the flow approaches the state of a self-sustained oscillation, since the growth rates of all the long term as well as short term trends in the time series vanish. A loss of multifractality in the time series is also observed as the flow approaches whistling. As a part of the this thesis, new, split high resolution schemes of high order are designed following the Hixon Turmel Proposal.

A realização de atividades de teste é indispensável para a garantia da qualidade de um produto e para a identificação de defeitos, diminuindo custos de manutenção e evitando ao máximo o risco do cliente encontrar esses defeitos. Nessa linha, testes baseados em modelos têm se mostrado atrativos, pois o custo de geração de casos de testes e de correção de defeitos tende a ser menor. Devido à sua simplicidade conceitual e expressividade na descrição do comportamento de um sistema, um dos modelos mais usados e pesquisados na área de teste baseado em modelos são as Máquinas de Estados Finitos (MEFs). Por meio de MEFs e com apoio de ferramentas apropriadas, a geração de casos de testes para avaliar os comportamentos esperados de um sistema é automatizada, reduzindo tanto o custo da geração e da manutenção quanto as falhas humanas. Desta forma, a aplicabilidade de métodos de geração de casos de teste baseados em modelos no contexto de sistemas embarcados vem sendo investigada. O objetivo deste trabalho de mestrado consiste em investigar a aplicabilidade dos métodos de geração em cenários de teste reais, com foco em sistemas embarcados, identificando as difi- culdades e limitações do processo, bem como os requisitos essenciais para a adequação dos métodos de geração propostos na literatura e de ferramentas de apoio à atividade de teste. O foco principal do projeto é a implementação de mecanismos que atendam aos requisitos levantados, visando a usabilidade, segurança e portabilidade da ferramenta / Test activities are essential to ensure the quality of products and identify faults to reduce maintenance costs and avoid that the client finds these faults. In this sense, model-based tests have been proved useful, because the cost of generating test cases and fault correction tend to be smaller. Due to its conceptual simplicity and expressiveness in describing the behavior of a system, Finite State Machines (FSM) have been used and researched in the model-based testing area. FSMs, employed with the support of appropriate tools, enable the generation of test cases in an automated way to assess the expected behavior of a system, reducing both the generation and maintenance costs and human failures. Thus, the applicability of test cases generation methods based on models in the context of embedded systems should be investigated. Test cases generation methods based on FSM are designed to derive test cases from the model. In this context, this work aims to investigate the applicability of generation methods in real-world scenarios, focusing embedded systems. It should identify the difficulties and limitations of the process, as well as the essential requirements for the adequacy of generation methods proposed in the literature and tools to support the test activity. The main focus of the project is the implementation of mechanisms that meet the elicited requirements in order to provide usability, security and tool portability

Submitted by Fabio Sobreira Campos da Costa (fabio.sobreira@ufpe.br) on 2017-02-21T16:58:53Z No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Dissertação_SilviaVersaoFinal.pdf: 3562807 bytes, checksum: d273ad6c061161f899cab3d232a82a79 (MD5) / Made available in DSpace on 2017-02-21T16:58:54Z (GMT). No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Dissertação_SilviaVersaoFinal.pdf: 3562807 bytes, checksum: d273ad6c061161f899cab3d232a82a79 (MD5) Previous issue date: 2016-08-01 / FACEPE / Contexto: A fase de especificação de requisitos é fundamental no processo de desenvolvimento de software. O uso de cenários é bastante popular para especificar requisitos, por serem descritos em linguagem natural. No entanto, a linguagem natural dá margem a requisitos ambíguos, incompletos e inconsistentes, o que vai de encontro com os objetivos da fase de especificação de requisitos. Nesse sentido, uma técnica baseada em Cenário & LEL (Language Extended Lexicon), chamada de C&L, pode ser a solução adequada, pois LEL é um glossário que define um conjunto de palavras que pertencem a um domínio e que devem ser usadas para descrever os cenários. Assim, C&L é considerada uma técnica de cenários baseada em linguagem natural controlada que ajuda a minimizar os problemas previamente mencionados, além de poder ser utilizada para criar casos de teste de forma mais sistemática. Objetivo: Neste trabalho, são propostas duas abordagens: a primeira abordagem usa regras de mapeamento para derivar modelos statechart a partir de C&L visando verificar a completude e consistência desses cenários e a segunda usa heurísticas para obter sistematicamente casos de teste a partir de modelos statechart. Método: A pesquisa apresentada nessa dissertação seguiu a abordagem de Engenharia para definir as regras de mapeamento e as heurísticas que, por sua vez, foram avaliadas empiricamente. Resultados: As regras de mapeamento apoiam a derivação de statechart a partir de C&L. As heurísticas apoiam a derivação de casos de teste a partir dos modelos statechart. Foi realizado um experimento para comparar o número de erros de incompletude e inconsistência detectados pelos grupos experimental e controle e o tempo gasto pelos grupos para detectar esses erros. Também foi verificado se os statecharts gerados através da aplicação das regras de mapeamento possuem grau de corretude e semelhança. Foi realizada uma avaliação qualitativa das heurísticas utilizadas para derivar os casos de teste, com o intuito de saber se as heurísticas foram utilizadas corretamente, se estão claras e são fáceis de usar. Conclusões: Os resultados do experimento mostram que o número de erros de incompletude detectados pelo grupo experimental foi superior ao número obtido pelo grupo controle e em relação aos erros de inconsistência não houve diferença entre quantidade de erros detectados pelos dois grupos. Além disso, a média do tempo gasto para identificar erros de incompletude e inconsistência pelo grupo experimental foi ligeiramente superior a média do tempo gasto pelo grupo controle. Em relação ao grau de corretude, dentre os modelos gerados pelo grupo experimental, existe um que apresenta o maior grau de corretude com 85,7%. No entanto, o grau de semelhança entre os modelos é considerado de “baixa semelhança”. O resultado da avaliação qualitativa mostrou que os participantes concordaram que as regras de mapeamento e as heurísticas são compreensíveis e fáceis de utilizar. Também foi observado que as heurísticas foram usadas de maneira correta na derivação dos casos de teste. / Context: The requirements specification phase is fundamental in the software development process. The use of scenarios is quite popular to specify requirements because they are described in natural language. However, natural language gives rise to ambiguous, incomplete and inconsistent requirements, jeopardizes the objectives of the requirements specification phase. In this context, a technique based on Scenarios and LEL (Language Extended Lexicon), called C&L, may be an appropriate solution because LEL is a glossary that defines a set of words that belong to a domain and should be used to describe the scenarios. Thus, C&L is a scenario technique based on controlled natural language that helps to minimize the problems previously mentioned, and can be used to create test cases in a more systematic way. Objective: In this study, two approaches are proposed: the first approach uses mapping rules to derive statechart models from C & L in order to verify the completeness and consistency of these scenarios and the second uses heuristics to systematically derive test cases from statechart models. Method: The research presented in this work follows the engineering approach to define the mapping rules and heuristics that, in turn, were empirically evaluated. Results: Mapping rules support the derivation of statechart from C & L. Heuristics support the derivation of test cases from statechart models. An experiment was conducted to compare the number of incompleteness and inconsistency errors detected by the experimental and control the groups and the time spent by groups to detect these errors. Also it was verified whether the statecharts generated by the application of the mapping rules have degree of correctness and likeness. A qualitative evaluation of the heuristics used to derive the test cases was made, in order to know whether the heuristics were correctly used and if they are clear and easy to use. Conclusions: The results of the experiment show that the number of incompleteness errors detected by the experimental group was higher than the number obtained by the control group, and in relation to inconsistency errors, there was no difference among the number of errors detected by the two groups. Furthermore, the average time spent to identify incompleteness and inconsistency errors by the experimental group was slightly higher than the average time spent by the control group. In relation to the degree of correctness among the models generated by the experimental group, there is one that has the highest degree of correctness with 85.7%. However, the degree of similarity between the models is considered "low similarity”. The result of the qualitative evaluation showed that the participants agreed that the mapping rules and heuristics are comprehensible and easy to use. It was also observed that the heuristics were used correctly in the derivation of test cases.

O teste de software engloba diferentes técnicas, métodos e conceitos capazes de garantir a qualidade dos mais variados tipos de sistemas. Dentre tais técnicas, encontra-se o teste baseado em Máquinas de Estados Finitos (MEFs), que visa a garantir a conformidade entre a implementação e a especificação de um software. Com esse propósito, diversos métodos foram propostos para a geração de seqüências de verificação que garantam cobertura total das possíveis falhas existentes em uma implementação. A maioria dos métodos conhecidos são baseados na utilização de seqüências de distinção. Esse recurso, porem, não existe para toda MEF. Alguns métodos buscam a geração de seqüências de verificação baseados em recursos alternativos as seqüências de distinção, contudo, as seqüências geradas são exponencialmente longas. Este trabalho apresenta um método para geração de seqüências de verificação que visa a reduzir o tamanho das seqüências geradas para o domínio de MEFs que não dispõem de seqüência de distinção. Para isso, o método proposto baseia-se na utilização de conjuntos de distinção. Uma avaliação experimental foi realizada afim de mensurar a redução proporcionada pelo método proposto em relação aos principais métodos existentes na literatura. Com esse intuito, foram geradas MEFs aleatórias sob a perspectiva diferentes fatores. Em relação a variação do número de estados, os resultados indicaram reduções acima de 99; 5% em comparação com os métodos existentes, quando analisadas 75% das MEFs geradas / Software testing involves several techniques, methods, and concepts employed to guarantee a high level of quality in different application domains. Among such techniques, Finite State Machine (FSM) based testing aims to guarantee the conformance between the implementation and the specification of a system under test. In this context, several methods were proposed to generate checking sequences that cover all the possible faults existing in an implementation. Most of these methods are based on a special sequence, named distinguishing sequence, which does not exist for every minimal machine. Some methods were proposed to generate checking sequences based on alternative solutions in order to be applied on FSMs that do not have distinguishing sequences. However, these methods generate checking sequences exponentially long. This work proposes a method to generate checking sequences using identification sets. These sets exist for every minimal FSM and also lead to shorter checking sequences. We conducted an experimental study to compare the proposed method with the main existing methods. In the experiments, we used random FSMs that have different configurations of states, inputs, and outputs. Concerning the variation of number of states, the results show reductions higher than 99:5% in comparison with the existing methods for 75% of the experimented machines

The operational profile-based testing is currently not a well-studied topic and there are no specific instructions for writing test cases for testing the program. In our thesis, we presented our idea about on the basis of what data test cases can be written. Also, in order to show the effectiveness of operational profile-based testing, we additionally described the equivalent partitioning testing technique. The software for this experiment was taken from the open-source SIR repository. We have selected software: “Account”, that was tested by two different testing methods. The test results of both techniques were compared and it was determined that the operational profile-based testing technique is more effective.

Diplomová práce popisuje vývojovou techniku Model Based Design a její použití pro návrh a testování algoritmů. Popis této techniky je proveden na příkladu praktického využití v praxi při vývoji modulu monitorování stavu motoru ve spolupráci se společností UNIS,a.s. Vývoj v oblasti současné letecké techniky klade velký důraz na monitorování životnosti zařízení. Podle výstupů algoritmu se dají naplánovat preventivní opravy s ohledem na aktuální podmínky opotřebení a provozování. Implementace algoritmů je provedena v prostředí Matlab/Simulink s následným testováním na platformě dSpace

Developing software without considering the potential changes it mighthave to undergo in the future can be a costly mistake. This is becauseits maintenance costs can become very expensive as they can consumeover 90% of the total life-cycle costs. Incorporating maintainability insoftware has for this reason become highly attractive since it can significantlyreduce the maintenance costs and therefore save companies andsoftware developers a fortune. This thesis presents a software tool thathas been developed to aid Bombardier in the verification of computerbasedinterlocking (CBI) systems. The tool automatically generates testcases which represent the different tests that verify the interlocking system.The paper is divided into two parts. The first part focuses on themaintainability of the tool while the second part investigates whetherthe tool can speed up the testing process of CBI-systems at Bombardier.The results show that the tool is highly maintainable and that tests onCBI-systems can be performed significantly faster with it. / Att utveckla mjukvara utan hänsyn till de eventuella förändringar somden måste genomgå i framtiden kan bli ett kostsamt misstag. Dettaberor på att dess underhållskostnader kan bli mycket dyra eftersom dekan konsumera över 90% av de totala kostnaderna. Det har därför blivitväldigt attraktivt att lägga fokus på underhållbarhet när man utvecklarmjukvara eftersom det kan avsevärt minska underhållskostnadernaoch därmed spara mjukvaruutvecklare och företag en förmögenhet. Idenna uppsats presenteras ett verktyg som har utvecklats för att hjälpaBombardier med verifiering av datorställverk. Verktyget automatisktgenererar testfall som representerar de olika testen som verifierar ställverket.Uppsatsen är uppdelad i två delar. Den första delen fokuserarpå verktygets underhållbarhet medan den andra delen undersöker omverktyget kan påskynda testprocessen för datorställverk på Bombardier.Resultaten visar att verktyget är väldigt underhållbart och att

The main part in the testing of the software is in the generation of test cases suitable for software system testing. The quality of the test cases plays a major role in reducing the time of software system testing and subsequently reduces the cost. The test cases, in model de- sign stages, are used to detect the faults before implementing it. This early detection offers more flexibility to correct the faults in early stages rather than latter ones. The best of these tests, that covers both static and dynamic software system model specifications, is one of the chal- lenges in the software testing. The static and dynamic specifications could be represented efficiently by Unified Modelling Language (UML) class diagram and sequence diagram. The work in this thesis shows that High Level Petri Nets (HLPN) can represent both of them in one model. Using a proper model in the representation of the software specifications is essential to generate proper test cases. The research presented in this thesis introduces novel and automated test cases generation techniques that can be used within a software sys- tem design testing. Furthermore, this research introduces e cient au- tomated technique to generate a formal software system model (HLPN) from semi-formal models (UML diagrams). The work in this thesis con- sists of four stages: (1) generating test cases from class diagram and Object Constraint Language (OCL) that can be used for testing the software system static specifications (the structure) (2) combining class diagram, sequence diagram and OCL to generate test cases able to cover both static and dynamic specifications (3) generating HLPN automat- ically from single or multi sequence diagrams (4) generating test cases from HLPN. The test cases that are generated in this work covered the structural and behavioural of the software system model. In first two phases of this work, the class diagram and sequence diagram are decomposed to nodes (edges) which are linked by Classes Hierarchy Table (CHu) and Edges Relationships Table (ERT) as well. The linking process based on the classes and edges relationships. The relationships of the software system components have been controlled by consistency checking technique, and the detection of these relationships has been automated. The test cases were generated based on these interrelationships. These test cases have been reduced to a minimum number and the best test case has been selected in every stage. The degree of similarity between test cases is used to ignore the similar test cases in order to avoid the redundancy. The transformation from UML sequence diagram (s) to HLPN facilitates the simpli cation of software system model and introduces formal model rather than semi-formal one. After decomposing the sequence diagram to Combined Fragments, the proposed technique converts each Combined Fragment to the corresponding block in HLPN. These blocks are con- nected together in Combined Fragments Net (CFN) to construct the the HLPN model. The experimentations with the proposed techniques show the effectiveness of these techniques in covering most of the software system specifications.

Tato diplomová práce popisuje testování REST API rozhraní aplikací. Výsledkem práce je aplikace Restty, založená na použití nástroje Swagger, která umožňuje testovat jednotlivé části API aplikací, i vytvářet a spouštět komplexní testovací scénáře nad daným rozhraním. Teoretická část práce vysvětluje principy webových služeb, vzdálených rozhraní a představuje nástroj Swagger i technologie použité k implementaci. V následující kapitole jsou v práci prezentovány designové návrhy aplikace, na které plynule navazuje kapitola o implementaci a testování, pro které je zvoleno rozhraní nástroje Red Hat JBoss BPM Suite. V závěru práce jsou vyhodnoceny přínosy aplikace Restty a navrženy případné budoucí rozšíření.