Programinės įrangos testavimas yra kritinė viso kūrimo proceso dalis. Kokybe privalo rūpintis ne vien testuotojai. Programuotojai turi naudoti įvairias kokybės užtikrinimo technikas, tokias kaip statinė kodo analizė (kodo peržiūra) ir vienetų testavimas. Kartais programuotojai praleidžia kodo testavimą arba atlieka tik paviršutinį testavimą, nes tai užimą jų laiką. Automatiniai testavimo įrankiai suteikia galimybes testavimo kaštų sumažinimui. Sukurta daug įvairių testavimo atvejų generavimo technikų naudojant specializuotus įrankius. Testavimo atvejų generavimo tikslas yra pasiekti kuo didesnį kodo padengimą ir rasti netikėtas klaidas. Daugumoje atvejų yra neįmanoma pasiekti visišką kodo padengimą, naudojant vien generuotus testavimo atvejus. Reikalingi testavimo atvejai, parašyti žmogaus. Logiška pakartotinai naudoti testus, kuriais buvo ištestuoti panašūs metodai anksčiau. Šiame darbe analizuojama testų pakartotino panaudojimo problema. Siūlomas sprendimas yra paremtas vienetų testų saugojimu ir pakartotinu panaudojimu lyginant testuojamą metodą ir jau ištestuotą, kuris turi išsaugotus vienetų testus. Siūlomas metodas turėtų būti naudojamas kartu su vienetų testų generavimo įrankiais. / Software testing is critical part in software development. Not only testers are responsible for software quality. Programmers should use quality assurance techniques as code static analysis (code review) and unit testing. Sometimes developers omit testing their code or perform just superficial testing because unit testing consumes development time. Automated unit testing tools provide the way for reducing of testing costs. There are various techniques for generating test cases by using specialized tools. The goal of generation of tests cases is to achieve higher code coverage and expose unexpected errors. In many cases it is impossible to achieve full code coverage by using only generated test cases. Then manual efforts are needed. It is reasonable to reuse unit tests for method similar to that already tested. This work helps to analyse unit test reusability problem. The approach presented is based on unit test storing and reusing by comparing current testing method and method that has saved tests. This method should be used in combination with particular unit test generation tool.

No description available.

Writing declarative models of software designs and analyzing them to detect defects is an effective methodology for developing more dependable software systems. However, writing such models correctly can be challenging for practitioners who may not be proficient in declarative programming, and their models themselves may be buggy. We introduce the foundations of a novel test automation framework, AUnit, which we envision for testing declarative models written in Alloy -- a first-order, relational language that is supported by its SAT-based analyzer. We take inspiration from the success of the family of xUnit frameworks that are used widely in practice for test automation, albeit for imperative or object-oriented programs. The key novelty of our work is to define a basis for unit testing for Alloy, specifically, to define the concepts of test case and test coverage as well as coverage criteria for declarative models. We reduce the problems of declarative test execution and coverage computation to partial evaluation without requiring SAT solving. Our vision is to blend how developers write unit tests in commonly used programming languages with how Alloy users formulate their models in Alloy, thereby facilitating the development and testing of Alloy models for both new Alloy users as well as experts. We illustrate our ideas using a small but complex Alloy model. While we focus on Alloy, our ideas generalize to other declarative languages (such as Z, B, ASM). / text

This thesis deals with the design of a floating point module, which allows to perform operations with floating point operands that have any bit width. For this purpose, the module is implemented as a template class in C ++. The module is designed to allow it to be used when designing an application-specific processor. First, the floating point number and template functions in c ++ are described. In the practical part the algorithms of the individual operations and the design of the module itself are described as template libraries.

Testing is an integral part of software development with the goal of verifying a system’s requirements. One of the most commonly used methods for verifying code is unit testing. If done properly, unit testing can guarantee the intended functionality of a code unit. Furthermore, sufficiently tested code provides dependents with a level of trust in the code’s abilities. The unit testing process has several flaws; it is difficult to identify which code must be tested; and it is challenging to maintain tests pertaining to inconstant systems. Automatic test case generation tools are a common alternative to writing tests manually. However, these tools often focus on high code coverage, but produce flaky and unreliable tests. The goal of this thesis is to develop a prototype for a unit testing application that facilitates unit test creation and maintenance for JavaScript. Using code analysis metrics, the application aims to give developers an aid in deciding what code units to test. In order to construct this prototype, a literature study was conducted, focused on unit testing and code metrics. After having constructed the prototype, a user study, in the form of an interview, was conducted in order to evaluate its usefulness. Results from the user study shows that the application could be beneficial for people with limited experience in unit testing. However, in order to determine the effectiveness of various code analysis metrics, a more thorough study would be needed. / Testning är en central del i mjukvaruutvecklingsprocessen med syftet att verifiera systemkrav. Enhetstestning är en av de mest vanliga metoderna för att verifiera kodlogik. Under rätt förutsättningar kommer enhetstester garantera den avsedda funktionaliteten hos kodsektioner. Vidare erhåller kodkomponenter beroende av väl testad kod en grad av förtroende för kodens utlovade funktion. Det finns ett flertal brister när det kommer till processen för att skapa enhetstester: identifiering av kod i behov av att testas är svårt och det är utmanande att underhålla tester för system under utveckling. Ett vanligt alternativ till det manuella testskapandet är att använda ett automatiskt testgenereringsverktyg. Fokuset hos dessa verktyg ligger på att uppnå stor kodteckning, men de genererade testerna är oftast bristfälliga samt opålitliga. Målet med detta examensarbete är att utveckla en prototyp för en enhetstestignsapplikation som förenklar skapandet och underhållandet av enhetstester för JavaScript. Applikationen ämnar att med hjälp av kodmått förenkla för utvecklaren när det kommer till att bestämma vad som bör testas. För att utveckla prototypen genomförs en litteraturstudie med fokus på enhetstestning och kodmått. Efter utvecklandet av prototypen genomfördes en användarstudie för att utvärdera dess användbarhet. Studien utfördes i form av en intervju. Resultatet från användarstudien visar att applikationen kan vara till nytta för personer med begränsad erfarenhet av enhetstestning. Dock skulle en mer gedigen studie behöva genomföras för att kunna utvärdera kodmåttens effektivitet.

Este trabalho descreve a Klein, uma biblioteca genérica para álgebra linear em C++. A Klein facilita o uso de matrizes e vetores, permitindo que o usuário programe de modo similar ao Matlab. Com ela podemos, por exemplo, implementar um passo do método de Newton para a função f, através da expressão x = x - inv(jac(x)) * f(x), onde x é o vetor, jac a Jacobiana e inv a inversa. Além disso, por se tratar de uma biblioteca genérica, os tipos envolvidos nestas expressões podem ser escolhidos pelo programador. O trabalho também discute como a biblioteca é testada, tanto do ponto de vista de corretude quanto de desempenho. / We describe the Klein library, a generic libray for linear algebra in C++. It simplifies the use of vectors and matrices and let the user program as in Matlab. With Klein, one can for instance implement Newton\'s method as x = x - inv(jac(x)) * f(x), where x is a vector, jac is the Jacobian matrix, inv is the inverse operator and f(x) is the function of which we want to find zero. Moreover, Klein is generic in the sense that it allows the use of arbitrary types of scalars (float, double, intervals, rationals, etc). We also explain how it is tested, both for correctness and performance.

The diploma objectives are to describe software quality model defined in ISO/IEC 9126, to describe the basic concepts of quality assurance and software testing, to identify possible errors when writing tests, introduce designs patterns for writing tests. Further describe the architecture of applications built on the Java EE platform, to introduce frameworks for testing various parts of the applications built on the Java EE platform, to illustrate the creation of unit tests using test doubles for these applications, to evaluate the importance of unit tests for quality assurance software.

Este trabalho descreve a Klein, uma biblioteca genérica para álgebra linear em C++. A Klein facilita o uso de matrizes e vetores, permitindo que o usuário programe de modo similar ao Matlab. Com ela podemos, por exemplo, implementar um passo do método de Newton para a função f, através da expressão x = x - inv(jac(x)) * f(x), onde x é o vetor, jac a Jacobiana e inv a inversa. Além disso, por se tratar de uma biblioteca genérica, os tipos envolvidos nestas expressões podem ser escolhidos pelo programador. O trabalho também discute como a biblioteca é testada, tanto do ponto de vista de corretude quanto de desempenho. / We describe the Klein library, a generic libray for linear algebra in C++. It simplifies the use of vectors and matrices and let the user program as in Matlab. With Klein, one can for instance implement Newton\'s method as x = x - inv(jac(x)) * f(x), where x is a vector, jac is the Jacobian matrix, inv is the inverse operator and f(x) is the function of which we want to find zero. Moreover, Klein is generic in the sense that it allows the use of arbitrary types of scalars (float, double, intervals, rationals, etc). We also explain how it is tested, both for correctness and performance.

This Master's thesis is about analysis of Internet of Things project BeeeOn, design and production of unit, integration and system tests and their automation by utilization of Continuous integration system Jenkins CI. The theoretical part is devoted to software testing fundamentals and Continuous integration systems. The main point of this thesis is about specification and description of BeeeOn system, its requirements for automatic testing and its implementation. In conclusion, the results of this work and expansion possibilities are discussed.

The dissertation covers the process of automatic software testing. It describes fundamental principles of tests creation and presents common tools for concurrent integration. The main objective of the dissertation is improvement of the automatic testing process in the Department Corporate Technology Development Center of the Company Siemens Ltd., which was realized through the plug-in module for the TeamCity tool that makes reporting of test results more transparent. At the end of the dissertation, there are designed extensions of the plug-in module that could have a further benefit for automatic testing process by means of the TeamCity tool. The dissertation also includes the manual for easy installation of the implemented solution.