Thèses : « Test case selection and execution »

1

Bogren, Patrik, et Isak Kristola. « Exploring the use of call stack depth limits to reduce regression testing costs ». Thesis, Mittuniversitetet, Institutionen för data- och systemvetenskap, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-43166.

Texte intégral

Résumé :

Regression testing is performed after existing source code has been modified to verify that no new faults have been introduced by the changes. Test case selection can be used to reduce the effort of regression testing by selecting a smaller subset of the test suite for later execution. Several criteria and objectives can be used as constraints that should be satisfied by the selection process. One common criteria is function coverage, which can be represented by a coverage matrix that maps test cases to methods under test. The process of generating and evaluating these matrices can be very time consuming for large matrices since their complexity increases exponentially with the number of tests included. To the best of our knowledge, no techniques for reducing execution matrix size have been proposed. This thesis develops a matrix-reduction technique based on analysis of call stack data. It studies the effects of limiting the call stack depth in terms of coverage accuracy, matrix size, and generation costs. Further, it uses a tool that can instrument Java projects using Java’s instrumentation API to collect coverage information on open-source Java projects for varying depth limits of the call stack. Our results show that the stack depth limit can be significantly reduced while retaining high coverage and that matrix size can be decreased by up to 50%. The metric we used to indicate the difficulty of splitting up the matrix closely resembled the curve for coverage. However, we did not see any significant differences in execution time for lower depth limits.

Styles APA, Harvard, Vancouver, ISO, etc.

2

Ying, PuLe, et LingZhi Fan. « Methods For Test Case Prioritization Based On Test Case Execution History ». Thesis, Blekinge Tekniska Högskola, Institutionen för programvaruteknik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-14785.

Texte intégral

Résumé :

Motivation: Test case prioritization can prioritize test cases, optimize the test execution, save time and cost. There are many different methods for test case prioritization, test case prioritization method based on test case execution history is one kind of them. Based on the test case execution history, it’s easier to increase the rate of fault detection, hence we want to do a study about test case prioritization methods based on the test case execution history. Meanwhile, executing the feasible methods to compare the effectiveness of them. For the motivation of the thesis may be regarded as an example for experiencing approach for comparing test case prioritizations based on test case execution history, or as a study case for identifying the suitable methods to use and help improve the effectiveness of the testing process. Objectives: The aim of this thesis is to look for a suitable test case prioritization method that can support risk based testing, in which test case execution history is employed as the key criterion of evaluation. For this research, there are three main objectives. First, explore and summarize methods of test case prioritization based on test case history. Next, identify what are differences among the test case prioritization methods. Finally, execute the methods which we selected, and compare the effectiveness of methods. Methods: To achieve the first and the second study objectives, a systematic literature review has been conducted using Kitchenham guidelines. To achieve the third study objective, an experiment was conducted following Wohlin guidelines. Results: In our thesis: 1) We conducted a systematic literature review and selected 15 relevant literatures. We extracted data of the literatures and then we synthesized the data. We found that the methods have different kinds of inputs, test levels, maturity levels, validation and "automated testing or manual testing". 2) We selected two feasible methods from those 15 literatures, Method 1 is Adaptive test-case prioritization and Method 2 is Similarity-based test quality metric. We executed the methods within 17 test suites. Comparing the result of two methods and non-prioritization, the mean Average Percentage of Defects Found (APFD) of Adaptive test-case prioritization execution result (86.9%) is significantly higher than non-prioritization (51.5%) and Similarity-based test quality metric (47.5%), it means that the Adaptive test-case prioritization has higher effectiveness. Conclusion: In our thesis, existing test case prioritization methods based on test case execution history are extracted and listed out through systematic literature review. The summary of them and the description of differences can be available in the thesis. The 15 relevant literatures and the synthesized data may be as a guideline for relevant software researchers or testers. We did the statistical test for the experimental result, we can see two different test case prioritization methods have different effectiveness.

Styles APA, Harvard, Vancouver, ISO, etc.

3

Zhan, Zhiyan. « Automated test case selection ». Thesis, University of Ottawa (Canada), 1995. http://hdl.handle.net/10393/10209.

Texte intégral

Résumé :

In this thesis, we present an automatic test case selection system, which aims at selecting test cases for both control and data flow oriented testing. In our system, path expressions are employed, path expression generation and complete path selection algorithms are used to achieve the automation of path selection, and problems with loop iterations are addressed. Partial symbolic execution is applied to reduce the effort wasted in analyzing infeasible paths. Linear programing, path predicate simplification, and path predicate evaluation techniques are employed to solve the inequalities resulted from partial symbolic execution as well as symbolic execution. Our system is also capable of selecting different sets of test cases by applying different test selection criteria to achieve different test coverage which serve different test purposes. In our system, first a flowgraph modeling both control and data flow information contained in the program under test is constructed. Second, by applying a control or data flow oriented test selection criterion to this flowgraph, a set of test units is built. Finally, through path expression generation, partial symbolic execution, symbolic execution. predicate simplification/evaluation, and linear programming, a set of test cases is selected examples produced by ETSG are provided.

Styles APA, Harvard, Vancouver, ISO, etc.

4

Yadavalli, Tejaswy. « An industrial case study to improve test case execution time ». Thesis, Blekinge Tekniska Högskola, Institutionen för programvaruteknik, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-20889.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

5

Lindholm, David. « Economics of Test Automation : Test case selection for automation ». Thesis, Linköpings universitet, Programvara och system, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-154941.

Texte intégral

Résumé :

In this thesis a method for selecting test cases for test automation is developed and evaluated. Existing methods from the literature has been reviewed and modified resulting in the proposed method, a decision tree containing 23 factors grouped into 8 decision points. The decision tree has been used and evaluated in an industrial setting. The economic benefits were calculated with return on investment and the organisational benefits were measured in a survey at a software producing company. The result was that automated tests, selected with the decision tree, provided economic benefits after 0.5 to 4 years, these tests were also found leading to 3 organisational benefits: less human effort when testing, reduction in cost and allowing for shorter release cycles.

Styles APA, Harvard, Vancouver, ISO, etc.

6

Höstklint, Niklas, et Jesper Larsson. « Dynamic Test Case Selection using Machine Learning ». Thesis, KTH, Hälsoinformatik och logistik, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-296634.

Texte intégral

Résumé :

Testing code is a vital part at any software producing company, to ensure no faulty code slips through that could have detrimental consequences. At Ericsson, testing code before publishing is a very costly process which can take several hours. Currently, every single test is run for all submitted code. This report aims to address the issue by building a machine learning model that determines which tests need to be run, so that unnecessary tests are left out, saving time and resources. It is however important to find the failures, as having certain failures pass through into production could have all types of economic, environmental and social consequences. The result shows that there is great potential in several different types of models. A Linear Regression model found 92% of all failures within running 25% of all test categories. The linear model however plateaus before finding the final failures. If finding 100% of failures is essential, a Support Vector Regression model proved the most efficient as it was the only model to find 100% of failures within 90% of test categories being run.
Testning av kod är en avgörande del för alla mjukvaruproducerande företag, för att säkerställa att ingen felaktig kod som kan ha skadlig påverkan publiceras. Hos Ericsson är testning av kod innan det ska publiceras en väldigt dyr process som kan ta flera timmar. Vid tiden denna rapport skrivs så körs varenda test för all inlämnad kod. Denna rapport har som mål att lösa/reducera problemet genom att bygga en modell med maskininlärning som avgör vilka tester som ska köras, så onödiga tester lämnas utanför vilket i sin tur sparar tid och resurser. Dock är det viktigt att hitta alla misslyckade tester, eftersom att tillåta dessa passera till produktionen kan innebära alla möjliga olika ekonomiska, miljömässiga och sociala konsekvenser. Resultaten visar att det finns stor potential i flera olika typer av modeller. En linjär regressionsmodell hittade 92% av alla fel inom att 25% av alla test kategorier körts. Den linjära modellen träffar dock en platå innan den hittar de sista felen. Om det är essentiellt att hitta 100% av felen, så visade sig en support vector regressionsmodell vara mest effektiv, då den var den enda modellen som lyckades hitta 100% av alla fel inom att 90% alla test kategorier hade körts.

Styles APA, Harvard, Vancouver, ISO, etc.

7

Normann, Filip. « Test Case Selection Based on Code Changes ». Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-397290.

Texte intégral

Résumé :

As a software project grows, continuous integration (CI) requiresmore and more resources and the lag for the developer to get feedbackfrom a code commit gets larger and larger. This thesis is aboutresearching and implementing a way to reduce the end to end time ofthe CI flow for an Ericsson inhouse product by reducing the time torun regression tests. The inhouse product is a large Java frameworkfor testing radio equipment. Research was done to figure out how toimplement test case selection for the project. The research wasconcluded with the decision to make a test case selection algorithmwritten in Groovy. Leveraging code dependencies and the delta betweenthe committed code and its parent commit. The designed solution showsthe potential to reduce time and resources spent testing committedcode. Saving both computing power and reducing time for test resultfeedback to get back to developers, increasing productivity for thedevelopment team.

Styles APA, Harvard, Vancouver, ISO, etc.

8

Bester, Willem Hendrik Karel. « Bug-finding and test case generation for java programs by symbolic execution ». Thesis, Stellenbosch : Stellenbosch University, 2013. http://hdl.handle.net/10019.1/85832.

Texte intégral

Résumé :

Thesis (MSc)--Stellenbosch University, 2013.
ENGLISH ABSTRACT: In this dissertation we present a software tool, Artemis, that symbolically executes Java virtual machine bytecode to find bugs and automatically generate test cases to trigger the bugs found. Symbolic execution is a technique of static software analysis that entails analysing code over symbolic inputs—essentially, classes of inputs—where each class is formulated as constraints over some input domain. The analysis then proceeds in a path-sensitive way adding the constraints resulting from a symbolic choice at a program branch to a path condition, and branching non-deterministically over the path condition. When a possible error state is reached, the path condition can be solved, and if soluble, value assignments retrieved to be used to generate explicit test cases in a unit testing framework. This last step enhances confidence that bugs are real, because testing is forced through normal language semantics, which could prevent certain states from being reached. We illustrate and evaluate Artemis on a number of examples with known errors, as well as on a large, complex code base. A preliminary version of this work was successfully presented at the SAICSIT conference held on 1–3 October 2012, in Centurion, South Africa.
AFRIKAANSE OPSOMMING: In die dissertasie bied ons ’n stuk sagtewaregereedskap, Artemis, aan wat biskode van die Java virtuele masjien simbolies uitvoer om foute op te spoor en toetsgevalle outomaties voort te bring om die foute te ontketen. Simboliese uitvoering is ’n tegniek van statiese sagteware-analise wat behels dat kode oor simboliese toevoere—in wese, klasse van toevoer—geanaliseer word, waar elke klas geformuleer word as beperkinge oor ’n domein. Die analise volg dan ’n pad-sensitiewe benadering deur die domeinbeperkinge, wat volg uit ’n simboliese keuse by ’n programvertakking, tot ’n padvoorwaarde by te voeg en dan nie-deterministies vertakkings oor die padvoorwaarde te volg. Wanneer ’n moontlike fouttoestand bereik word, kan die padvoorwaarde opgelos word, en indien dit oplaasbaar is, kan waardetoekennings verkry word om eksplisiete toetsgevalle in ’n eenheidstoetsingsraamwerk te formuleer. Die laaste stap verhoog vertroue dat die foute gevind werklik is, want toetsing word deur die normale semantiek van die taal geforseer, wat sekere toestande onbereikbaar maak. Ons illustreer en evalueer Artemis met ’n aantal voorbeelde waar die foute bekend is, asook op ’n groot, komplekse versameling kode. ’n Voorlopige weergawe van die´ werk is suksesvol by die SAICSIT-konferensie, wat van 1 tot 3 Oktober 2012 in Centurion, Suid-Afrika, gehou is, aangebied.

Styles APA, Harvard, Vancouver, ISO, etc.

9

Drincic, Samir, et Asim Dedic. « Evolving test-case selection at a large scale company ». Thesis, Blekinge Tekniska Högskola, Avdelningen för programvarusystem, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-1364.

Texte intégral

Résumé :

This paper presents a possible solution for selection of test-cases that should be executed to provide good coverage and quality at UIQ Technologies. It describes how the company can sort and prioritize their test-cases, so that quality is maintained while having controlled amount of test-cases. The idea behind the proposed method is to prioritize the test-cases and execute those that received highest prioritization first and thereby ensuring that all high-risk defects are found first. We have created a model that performs those tasks and we have also executed it on an ongoing project at UIQ Technology to provide data for comparison with the currently used model. We also make a comparison proving that our proposed method is more effective then the current method. We have emphasized adaptability and changeability of the model so that UIQ Technology easily can modify and adapt the model later on.

Styles APA, Harvard, Vancouver, ISO, etc.

10

Morrison, George Campbell. « Automated coverage calculation and test case generation ». Thesis, Stellenbosch : Stellenbosch University, 2012. http://hdl.handle.net/10019.1/20041.

Texte intégral

Résumé :

Thesis (MScEng)--Stellenbosch University, 2012.
ENGLISH ABSTRACT: This research combines symbolic execution, a formal method of static analysis, with various test adequacy criteria, to explore the e ectiveness of using symbolic execution for calculating code coverage on a program's existing JUnit test suites. Code coverage is measured with a number of test adequacy criteria, including statement coverage, branch coverage, condition coverage, method coverage, class coverage, and loop coverage. The results of the code coverage calculation is then used to automatically generate JUnit test cases for areas of a program that are not su ciently covered. The level of redundancy of each test case is also calculated during coverage calculation, thereby identifying fully redundant, and partially redundant, test cases. The combination of symbolic execution and code coverage calculation is extended to perform coverage calculation during a manual execution of a program, allowing testers to measure the e ectiveness of manual testing. This is implemented as an Eclipse plug-in, named ATCO, which attempts to take advantage of the Eclipse workspace and extensible user interface environment to improve usability of the tool by minimizing the user interaction required to use the tool. The code coverage calculation process uses constraint solving to determine method parameter values to reach speci c areas in the program. Constraint solving is an expensive computation, so the tool was parallellised using Java's Concurrency package, to reduce the overall execution time of the tool.
AFRIKAANSE OPSOMMING: Hierdie navorsing kombineer simboliese uitvoering, 'n formele metode van statiese analise, met verskeie toets genoegsaamheid kriteria, om die e ektiwiteit van die gebruik van simboliese uitvoer te ondersoek vir die berekening van kode dekking op 'n program se bestaande JUnit toets stelle. Kode dekking word gemeet deur verskeie toets genoegsaamheid kriteria, insluited stelling dekking, tak dekking, kondisie dekking, metode dekking, klas dekking, en lus dekking. Die resultate van die kode dekking berekeninge word dan gebruik om outomaties JUnit toets voorbeelde te genereer vir areas van 'n program wat nie doeltre end ondersoek word nie. Die vlak van oortolligheid van elke toets voorbeeld word ook bereken gedurende die dekkingsberekening, en daardeur word volledig oortollige, en gedeeltelik oortollige, toets voorbeelde identi seer. Die kombinasie van simboliese uitvoer en kode dekking berekening is uitgebrei deur die uitvoer van dekking berekeninge van 'n gebruiker-beheerde uitvoer, om sodoende kode dekking van 'n gebruiker-beheerde uitvoer van 'n program te meet. Dit laat toetsers toe om die e ektiwiteit van hulle beheerde uitvoer te meet. Bogenoemde word ge mplimenteer as 'n Eclipse aanvoegsel, genaamd ATCO, wat poog om voordeel te trek vanuit die Eclipse werkspasie, en die uitbreibare gebruiker oordrag omgewing, om die bruikbaarheid van ATCO te verbeter, deur die vermindering van die gebruiker interaksie wat benodig word om ATCO te gebruik. Die kode dekking berekeningsproses gebruik beperking oplossing om metode invoer waardes te bereken, om spesi eke areas in die program te bereik. Beperking oplossing is 'n duur berekening, so ATCO is geparalleliseer, met behulp van Java se Concurrency pakket, om die algehele uitvoer tyd van die program te verminder.

Styles APA, Harvard, Vancouver, ISO, etc.

11

Askling, Kim. « Application of Topic Models for Test Case Selection : A comparison of similarity-based selection techniques ». Thesis, Linköpings universitet, Programvara och system, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-159803.

Texte intégral

Résumé :

Regression testing is just as important for the quality assurance of a system, as it is time consuming. Several techniques exist with the purpose of lowering the execution times of test suites and provide faster feedback to the developers, examples are ones based on transition-models or string-distances. These techniques are called test case selection (TCS) techniques, and focuses on selecting subsets of the test suite deemed relevant for the modifications made to the system under test. This thesis project focused on evaluating the use of a topic model, latent dirichlet allocation, as a means to create a diverse selection of test cases for coverage of certain test characteristics. The model was tested on authentic data sets from two different companies, where the results were compared against prior work where TCS was performed using similarity-based techniques. Also, the model was tuned and evaluated, using an algorithm based on differential evolution, to increase the model’s stability in terms of inferred topics and topic diversity. The results indicate that the use of the model for test case selection purposes was not as efficient as the other similarity-based selection techniques studied in work prior to thist hesis. In fact, the results show that the selection generated using the model performs similar, in terms of coverage, to a randomly selected subset of the test suite. Tuning of the model does not improve these results, in fact the tuned model performs worse than the other methods in most cases. However, the tuning process results in the model being more stable in terms of inferred latent topics and topic diversity. The performance of the model is believed to be strongly dependent on the characteristics of the underlying data used to train the model, putting emphasis on word frequencies and the overall sizes of the training documents, and implying that this would affect the words’ relevance scoring to the better.

Styles APA, Harvard, Vancouver, ISO, etc.

12

Kaiser, Christoph. « Quantitative Analysis of Exploration Schedules for Symbolic Execution ». Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-216671.

Texte intégral

Résumé :

Due to complexity in software, manual testing is not enough to cover all relevant behaviours of it. A different approach to this problem is Symbolic Execution. Symbolic Execution is a software testing technique that tests all possible inputs of a program in the hopes of finding all bugs. Due to the often exponential increase in possible program paths, Symbolic Execution usually cannot exhaustively test a program. To nevertheless cover the most important or error prone areas of a program, search strategies that prioritize these areas are used. Such search strategies navigate the program execution tree, analysing which paths seem interesting enough to execute and which to prune. These strategies are typically grouped into two categories, general purpose searchers, with no specific target but the aim to cover the whole program and targeted searchers which can be directed towards specific areas of interest. To analyse how different searching strategies in Symbolic Execution affect the finding of errors and how they can be combined to improve the general outcome, the experiments conducted consist of several different searchers and combinations of them, each run on the same set of test targets. This set of test targets contains amongst others one of the most heavily tested sets of open source tools, the GNU Coreutils. With these, the different strategies are compared in distinct categories like the total number of errors found or the percentage of covered code. With the results from this thesis the potential of targeted searchers is shown, with an example implementation of the Pathscore-Relevance strategy. Further, the results obtained from the conducted experiments endorse the use of combinations of search strategies. It is also shown that, even simple combinations of strategies can be highly effective. For example, interleaving strategies can provide good results even if the underlying searchers might not perform well by themselves.
På grund av programvarukomplexitet är manuell testning inte tillräcklig för att täcka alla relevanta beteenden av programvaror. Ett annat tillvägagångssätt till detta problem är Symbolisk Exekvering (Symbolic Execution). Symbolisk Exekvering är en mjukvarutestningsteknik som testar alla möjliga inmatningari ett program i hopp om att hitta alla buggar. På grund av den ofta exponentiella ökningeni möjliga programsökvägar kan Symbolisk Exekvering vanligen inte uttömmande testa ettprogram. För att ändå täcka de viktigaste eller felbenägna områdena i ett program, används sökstrategier som prioriterar dessa områden. Sådana sökstrategier navigerar i programexekveringsträdet genom att analysera vilka sökvägar som verkar intressanta nog att utföra och vilka att beskära. Dessa strategier grupperas vanligtvis i två kategorier, sökare med allmänt syfte, utan något specifikt mål förutom att täcka hela programmet, och riktade sökare som kan riktas mot specifika intresseområden. För att analysera hur olika sökstrategier i Symbolisk Exekvering påverkar upptäckandetav fel och hur de kan kombineras för att förbättra det allmänna utfallet, bestod de experimentsom utfördes av flera olika sökare och kombinationer av dem, som alla kördes på samma uppsättning av testmål. Denna uppsättning av testmål innehöll bland annat en av de mest testade uppsättningarna av öppen källkod-verktyg, GNU Coreutils. Med dessa jämfördes de olika strategierna i distinkta kategorier såsom det totala antalet fel som hittats eller procenttalet av täckt kod. Med resultaten från denna avhandling visas potentialen hos riktade sökare, med ett exempeli form av implementeringen av Pathscore-Relevance strategin. Vidare stöder resultaten som erhållits från de utförda experimenten användningen av sökstrategikombinationer. Det visas också att även enkla kombinationer av strategier kan vara mycket effektiva.Interleaving-strategier kan till exempel ge bra resultat även om de underliggande sökarna kanske inte fungerar bra själva.

Styles APA, Harvard, Vancouver, ISO, etc.

13

Hessel, Anders. « Model-based test case selection and generation for real-time systems ». Licentiate thesis, Uppsala : Univ. : Division of Computer Systems, Department of Information Technology, Uppsala University, 2006. http://www.it.uu.se/research/publications/lic/2006-002/2006-002.pdf.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

14

Gamini, Devi charan. « Generate Test Selection Statistics With Automated Selective Mutation ». Thesis, Blekinge Tekniska Högskola, Institutionen för datavetenskap, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-19313.

Texte intégral

Résumé :

Context. Software systems are under constant updating for being faulty and to improve and introduce features. The Software testing is the most commonly used method for validating the quality of software systems. Agile processes help to automate testing process. A regression test is the main strategy used in testing. Regression testing is time consuming, but with increase in codebases is making it more time extensive and time consuming. Making regression testing time efficient for continuous integration is the new strategy. Objectives. This thesis focuses on co-relating code packages to test packages by automating mutation to inject error into C code. Regression testing against mutated code establishes co-relations. Co-relation data of particular modified code packages can be used for test selections. This method is most effective than the traditional test selection method. For this thesis to reduce the mutation costs selective mutation method is selected. Demonstrating the proof of concept helps to prove proposed hypothesis. Methods. An experiment answers the research questions. Testing of hypothesis on open source C programs will evaluate efficiency. Using this correlation method testers can reduce the testing cycles regardless of test environments. Results. Experimenting with sample programs using automated selective mutation the efficiency to co-relate tests to code packages was 93.4%. Results. After experimenting with sample programs using automated selective mutation the efficiency to co-relate tests to code packages was 93.4%. Conclusions. This research concludes that the automated mutation to obtain test selection statistics can be adopted. Though it is difficult for mutants to fail every test case, supposing that this method works with 93.4% efficient test failure on an average, then this method can reduce the test suite size to 5% for the particular modified code package.

Styles APA, Harvard, Vancouver, ISO, etc.

15

Ameerjan, Sharvathul Hasan. « Predicting and Estimating Execution Time of Manual Test Cases - A Case Study in Railway Domain ». Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-35929.

Texte intégral

Résumé :

Testing plays a vital role in the software development life cycle by verifying and validating the software's quality. Since software testing is considered as an expensive activity and due to thelimitations of budget and resources, it is necessary to know the execution time of the test cases for an efficient planning of test-related activities such as test scheduling, prioritizing test cases and monitoring the test progress. In this thesis, an approach is proposed to predict and estimate the execution time of manual test cases written in English natural language. The method uses test specifications and historical data that are available from previously executed test cases. Our approach works by obtaining timing information from each and every step of previously executed test cases. The collected data is used to estimate the execution time for non-executed test cases by mapping them using text from their test specifications. Using natural language processing, texts are extracted from the test specification document and mapped with the obtained timing information. After estimating the time from this mapping, a linear regression analysis is used to predict the execution time of non-executed test cases. A case study has been conducted in Bombardier Transportation (BT) where the proposed method is implemented and the results are validated. The obtained results show that the predicted execution time of studied test cases are close to their actual execution time.

Styles APA, Harvard, Vancouver, ISO, etc.

16

Kunze, Sebastian. « Automated Test Case Generation for Function Block Diagrams using Java Path Finder and Symbolic Execution ». Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-28315.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

17

MADHUKAR, ENUGURTHI. « GENERATE TEST SELECTION STATISTICS WITH AUTOMATED MUTATION TESTING ». Thesis, Blekinge Tekniska Högskola, Institutionen för datalogi och datorsystemteknik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-16836.

Texte intégral

Résumé :

Context: The goal of this research is to form a correlation between code packages and test cases which is done by using automated weak mutation. The correlations formed is used as the statistical test data for selecting relevant tests from the test suite which decreases the size of the test suite and speed up the process. Objectives: In this study, we have done an investigation of existing methods for reducing the computational cost of automatic mutation testing. After the investigation, we build an open source automatic mutation tool that mutates the source code to run on the test cases of the mutated code that maps the failed test to the part of the code that was changed. The failed test cases give the correlation between the test and the source code which is collected as data for future use of the test selection. Methods: Literature review and Experimentation is chosen for this research. It was a controlled experiment done at the Swedish ICT company to mutate the camera codes and test them using the regression test suite. The camera codes provided are from the continuous integration of historical data. We have chosen experimentation as our research because as this method of research is more focused on analyzing the data and implementing a tool using historical data. A literature review is done to know what kind of mutation testing reduces the computational cost of the testing process. The implementation of this process is done by using experimentation Results: The comparative results obtained after mutating the source code with regular mutants and weak mutants we have found that regular mutants and weak mutants are compared with their correlation accuracy and we found that on regular mutation operators we got 62.1% correlation accuracy and coming to weak mutation operators we got 85% of the correlation accuracy. Conclusions: This research on experimentation to form the correlations in generating test selection statistics using automated mutation testing in the continuous integration environment for improving test cases selection in regression testing

Styles APA, Harvard, Vancouver, ISO, etc.

18

PESSOA, MARCOS BORGES. « AUTOMATIC GENERATION AND EXECUTION OF TEST SCRIPTS FOR WEB APPLICATIONS FROM USE CASE DRIVEN BY BEHAVIOR ». PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2011. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=19129@1.

Texte intégral

Résumé :

Este trabalho visa explorar os requisitos de software, descritos na forma de casos de uso, como instrumento capaz de apoiar a geração e execução automática de testes funcionais, com o intuito de verificar automaticamente se o resultado obtido nos testes gerados e executados estão em conformidade com o especificado. O trabalho consiste em utilizar um processo e ferramenta para documentar casos de uso e automaticamente gerar e executar scripts de teste para verificar o comportamento funcional de aplicações web. As informações do caso de uso, em especial os fluxos de eventos (principal e alternativos), devem ser estruturados obedecendo um modelo de comportamento para que seja possível armazenar os dados e utilizá-los como entrada na integração com a ferramenta de testes. Neste trabalho, utilizou-se a ferramenta Selenium para a automação da interação com o navegador. A avaliação do esforço deu-se através da aplicação do processo em sistemas reais e através de comparação com outras técnicas aplicadas nos mesmos sistemas.
This work aims at exploring the software requirements, described in the form of use cases, as an instrument to support the automatic generation and execution of functional tests, in order to automatically check if the results obtained in the tests generated and executed are in accordance with specified. The establishes a process and a tool for documenting use cases and automatically generating and executing test scripts that verify the behavior of web applications. The content of the use case, especially the flow of events (main and alternative), is structured in accordance to a "behavior model" that stores the test data and generates input for a browser testing tool. In this work, we have used the Selenium tool to automate the interaction with the browser. The assessment of our approach involved the application of the process and generating tool in real systems, comparing the results with other techniques applied in the same systems.

Styles APA, Harvard, Vancouver, ISO, etc.

19

OLIVEIRA, NETO Francisco Gomes de. « Investigation of similarity-based test case selection for specification-based regression testing ». Universidade Federal de Campina Grande, 2014. http://dspace.sti.ufcg.edu.br:8080/jspui/handle/riufcg/360.

Texte intégral

Résumé :

Submitted by Johnny Rodrigues (johnnyrodrigues@ufcg.edu.br) on 2018-04-10T20:00:05Z No. of bitstreams: 1 FRANCISCO GOMES DE OLIVEIRA NETO - TESE PPGCC 2014..pdf: 5163454 bytes, checksum: 228c1fc4f2dc9aad01698011238cfde1 (MD5)
Made available in DSpace on 2018-04-10T20:00:05Z (GMT). No. of bitstreams: 1 FRANCISCO GOMES DE OLIVEIRA NETO - TESE PPGCC 2014..pdf: 5163454 bytes, checksum: 228c1fc4f2dc9aad01698011238cfde1 (MD5) Previous issue date: 2014-07-30
uring software maintenance, several modiﬁcations can be performed in a speciﬁcation model in order to satisfy new requirements. Perform regression testing on modiﬁed software is known to be a costly and laborious task. Test case selection, test case prioritization, test suite minimisation,among other methods,aim to reduce these costs by selecting or prioritizing a subset of test cases so that less time, effort and thus money are involved in performing regression testing. In this doctorate research, we explore the general problem of automatically selecting test cases in a model-based testing (MBT) process where speciﬁcation models were modiﬁed. Our technique, named Similarity Approach for Regression Testing (SART), selects subset of test cases traversing modiﬁed regions of a software system’s speciﬁcation model. That strategy relies on similarity-based test case selection where similarities between test cases from different software versions are analysed to identify modiﬁed elements in a model. In addition, we propose an evaluation approach named Search Based Model Generation for Technology Evaluation (SBMTE) that is based on stochastic model generation and search-based techniques to generate large samples of realistic models to allow experiments with model-based techniques. Based on SBMTE,researchers are able to develop model generator tools to create a space of models based on statistics from real industrial models, and eventually generate samples from that space in order to perform experiments. Here we developed a generator to create instances of Annotated Labelled Transitions Systems (ALTS), to be used as input for our MBT process and then perform an experiment with SART.In this experiment, we were able to conclude that SART’s percentage of test suite size reduction is robust and able to select a sub set with an average of 92% less test cases, while ensuring coverage of all model modiﬁcation and revealing defects linked to model modiﬁcations. Both SART and our experiment are executable through the LTS-BT tool, enabling researchers to use our selections trategy andr eproduce our experiment.
During software maintenance, several modiﬁcations can be performed in a speciﬁcation model in order to satisfy new requirements. Perform regression testing on modiﬁed software is known to be a costly and laborious task. Test case selection, test case prioritization, test suite minimisation,among other methods,aim to reduce these costs by selecting or prioritizing a subset of test cases so that less time, effort and thus money are involved in performing regression testing. In this doctorate research, we explore the general problem of automatically selecting test cases in a model-based testing (MBT) process where speciﬁcation models were modiﬁed. Our technique, named Similarity Approach for Regression Testing (SART), selects subset of test cases traversing modiﬁed regions of a software system’s speciﬁcation model. That strategy relies on similarity-based test case selection where similarities between test cases from different software versions are analysed to identify modiﬁed elements in a model. In addition, we propose an evaluation approach named Search Based Model Generation for Technology Evaluation (SBMTE) that is based on stochastic model generation and search-based techniques to generate large samples of realistic models to allow experiments with model-based techniques. Based on SBMTE,researchers are able to develop model generator tools to create a space of models based on statistics from real industrial models, and eventually generate samples from that space in order to perform experiments. Here we developed a generator to create instances of Annotated Labelled Transitions Systems (ALTS), to be used as input for our MBT process and then perform an experiment with SART.In this experiment, we were able to conclude that SART’s percentage of test suite size reduction is robust and able to select a sub set with an average of 92% less test cases, while ensuring coverage of all model modiﬁcation and revealing defects linked to model modiﬁcations. Both SART and our experiment are executable through the LTS-BT tool, enabling researchers to use our selections trategy andr eproduce our experiment.

Styles APA, Harvard, Vancouver, ISO, etc.

20

Kuchimanchi, Sriram. « Towards a regression test selection technique for message-based software integration ». ScholarWorks@UNO, 2004. http://louisdl.louislibraries.org/u?/NOD,164.

Texte intégral

Résumé :

Thesis (M.S.)--University of New Orleans, 2004.
Title from electronic submission form. "A thesis ... in partial fulfillment of the requirements for the degree of Master of Science in the Department of Computer Science."--Thesis t.p. Vita. Includes bibliographical references.

Styles APA, Harvard, Vancouver, ISO, etc.

21

Azizi, Maral. « Application of Adaptive Techniques in Regression Testing for Modern Software Development ». Thesis, University of North Texas, 2019. https://digital.library.unt.edu/ark:/67531/metadc1538762/.

Texte intégral

Résumé :

In this dissertation we investigate the applicability of different adaptive techniques to improve the effectiveness and efficiency of the regression testing. Initially, we introduce the concept of regression testing. We then perform a literature review of current practices and state-of-the-art regression testing techniques. Finally, we advance the regression testing techniques by performing four empirical studies in which we use different types of information (e.g. user session, source code, code commit, etc.) to investigate the effectiveness of each software metric on fault detection capability for different software environments. In our first empirical study, we show the effectiveness of applying user session information for test case prioritization. In our next study, we apply learning from the previous study, and implement a collaborative filtering recommender system for test case prioritization, which uses user sessions and change history information as input parameter, and return the risk score associated with each component. Results of this study show that our recommender system improves the effectiveness of test prioritization; the performance of our approach was particularly noteworthy when we were under time constraints. We then investigate the merits of multi-objective testing over single objective techniques with a graph-based testing framework. Results of this study indicate that the use of the graph-based technique reduces the algorithm execution time considerably, while being just as effective as the greedy algorithms in terms of fault detection rate. Finally, we apply the knowledge from the previous studies and implement a query answering framework for regression test selection. This framework is built based on a graph database and uses fault history information and test diversity in attempt to select the most effective set of test cases in term of fault detection capability. Our empirical evaluation of this study with four open source programs shows that our approach can be effective and efficient by selecting a far smaller subset of tests compared to the existing techniques.

Styles APA, Harvard, Vancouver, ISO, etc.

22

Lachmann, Remo Verfasser], et Ina [Akademischer Betreuer] [Schaefer. « Black-Box Test Case Selection and Prioritization for Software Variants and Versions / Remo Lachmann ; Betreuer : Ina Schaefer ». Braunschweig : Technische Universität Braunschweig, 2017. http://d-nb.info/1175816760/34.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

23

Wang, Huai, et 王怀. « Effective test case selection for context-aware applications based on mutation testing and adequacy testing from a context diversityperspective ». Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2013. http://hub.hku.hk/bib/B5043441X.

Texte intégral

Résumé :

Mutation testing and adequacy testing are two major technologies to assure the quality of software. In this thesis, we present the first work that alleviates the high cost of mutation testing and ineffectiveness of adequacy testing for context-aware applications. We also present large-scale multi-subject case studies to evaluate how our work successfully alleviates these problems. Mutation testing incurs a high execution cost if randomly selected test inputs kill a small percentage of remaining live mutants. To address this problem, we formulate the notion of context diversity to measure the context changes inherent in test inputs, and propose three context-aware strategies in the selection of test inputs. The empirical results show that the use of test inputs with higher context diversity can significantly benefit mutation testing in terms of resulting in fewer test runs, fewer test case trials, and smaller resultant test suites that achieve a high mutation score level. The case study also shows that at the test case level, the context diversity of test inputs positively and strongly correlates with multiple types of adequacy metrics, which provide a foundation on why context diversity contributes to the effectiveness of test cases in revealing faults in context-aware applications. In adequacy testing, many strategies randomly select test cases to construct adequate test suites with respect to program-based adequacy criteria. They usually exclude redundant test cases that are unable to improve the coverage of the test requirements of an adequacy criterion achieved by constructing test suites. These strategies have not explored in the diversity in test inputs to improve the test effectiveness of test suites. To address this problem, we propose three context-aware refined strategies to check whether redundant test cases can replace previously selected test cases to achieve the same coverage level but with different context diversity levels. The empirical study shows that context diversity can be significantly injected into adequate test suites, and favoring test cases with higher context diversity can significantly improve the fault detection rates of adequate test suites for testing context-aware applications. In conclusion, this thesis makes the significant contributions to the research in testing context-aware applications: (1) It has formulated context diversity, a novel metric to measure context changes inherent in test inputs. (2) It has proposed three context-aware strategies to select test cases with different levels of context diversity. Compared with the baseline strategy, the strategy CAS-H that uses test cases with higher context diversity can significantly reduce the cost of mutation testing over context-aware applications in terms of less number of test runs, smaller adequate test suites, and less number of test inputs used to construct test suites. (3) It has defined three context-aware refined strategies to construct adequate test suites with different context diversity levels. Compared with the baseline strategy, the strategy CARS-H that favors test cases with higher context diversity can significantly improve the effectiveness of adequacy testing in terms of higher fault detection rates.
published_or_final_version
Computer Science
Doctoral
Doctor of Philosophy

Styles APA, Harvard, Vancouver, ISO, etc.

24

Gillström, Niklas. « Log-selection strategies in a real-time system ». Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-25844.

Texte intégral

Résumé :

This thesis presents and evaluates how to select the data to be logged in an embedded realtime system so as to be able to give confidence that it is possible to perform an accurate identification of the fault(s) that caused any runtime errors. Several log-selection strategies were evaluated by injecting random faults into a simulated real-time system. An instrument was created to perform accurate detection and identification of these faults by evaluating log data. The instrument’s output was compared to ground truth to determine the accuracy of the instrument. Three strategies for selecting the log entries to keep in limited permanent memory were created. The strategies were evaluated using log data from the simulated real-time system. One of the log-selection strategies performed much better than the other two: it minimized processing time and stored the maximum amount of useful log data in the available storage space.
Denna uppsats illustrerar hur det blev fastställt vad som ska loggas i ett inbäddat realtidssystem för att kunna ge förtroende för att det är möjligt att utföra en korrekt identifiering av fel(en) som orsakat körningsfel. Ett antal strategier utvärderades för loggval genom att injicera slumpmässiga fel i ett simulerat realtidssystem. Ett instrument konstruerades för att utföra en korrekt upptäckt och identifiering av dessa fel genom att utvärdera loggdata. Instrumentets utdata jämfördes med ett kontrollvärde för att bestämma riktigheten av instrumentet. Tre strategier skapades för att avgöra vilka loggposter som skulle behållas i det begränsade permanenta lagringsutrymmet. Strategierna utvärderades med hjälp av loggdata från det simulerade realtidssystemet. En av strategierna för val av loggdata presterade klart bättre än de andra två: den minimerade tiden för bearbetning och lagrade maximal mängd användbar loggdata i det permanenta lagringsutrymmet.

Styles APA, Harvard, Vancouver, ISO, etc.

25

Sulehri, Latif. « Comparative Selection of Requirements Validation Techniques Based on Industrial Survey ». Thesis, Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-1178.

Texte intégral

Résumé :

In software engineering the requirements validation has very core importance. The requirements validation very helpful to judge that software requirements specification (SRS) is complete and free of bugs. The requirements validation is a assurance that the software requirements document is free of unwanted requirements and completely consistent. In order to remove inconsistency, detect defects and make the software requirements document fully functional the requirements validation is key factor. All possible requirements validation techniques available in academia such requirements reviews , requirements prototyping, requirements testing and viewpoint-oriented requirements validation are explained properly in this thesis report. In a very readable and understandable way the thesis presents all pros and cons of these requirements validation techniques practiced in different software companies in Sweden and available in academia. This report explains all possible advantages and issues related with these RVTs. In order to judge the best performance of these RVTs and to make their comparison I used a proper channel. I have designed a very effective survey questionnaire with the help of my colleges and literature review. To make creative comparison I conduct interviews and send survey questionnaire to different people working in requirements engineering departments in different software industries in Sweden. Finally the satisfaction levels of different software industries with these requirements validation techniques presents in this thesis report. These variables such as defect detection, time and cost are used to measure the satisfaction levels.
I Software Engineering kraven validering har en mycket central betydelse. Den kravvalidering very helpful att bedöma att Kravspecifikation (SRS) är klar och felfria. Kraven validering är en garanti för att programvaran kravdokument är fri från oönskade krav och helt konsekvent. För att undanröja inkonsekvens, upptäcka brister och göra programvaran kravdokument fullt funktionella kraven validering är viktig faktor. Alla möjliga kravvalidering tekniker inom den akademiska sådana krav recensioner, krav prototyper, provning och synpunkt-orienterade kravvalidering förklaras ordentligt i denna avhandling rapport. I ett mycket lättläst och begripligt sätt avhandling presenterar alla fördelar och nackdelar med dessa krav validera metoder praktiseras i olika mjukvaruföretag i Sverige och finns i den akademiska världen. Denna rapport förklarar alla möjliga fördelar och frågor kring dessa RVTs. För att bedöma de bästa resultaten i dessa RVTs och göra en jämförelse av dem använde jag en riktig kanal. Jag har skapat en mycket effektiv frågeformulär med hjälp av min högskolor och litteraturgenomgång. Skapa kreativa jämförelse jag intervjua och skicka frågeformuläret till olika personer som arbetar inom tekniska kraven för dessa avdelningar i olika programvaruföretag i Sverige. Slutligen tillfredsställande nivåer av olika programvaruföretag med dessa krav validering teknik presenteras i denna avhandling rapport. Dessa variabler såsom Upptäcka, tid och kostnader används för att mäta tillfredsställande nivåer.
Author: Latif Hussain Sulehri E-mail: latifsulehry@hotmail.com Phone: +46 704 917 140

Styles APA, Harvard, Vancouver, ISO, etc.

26

Siddiqui, Asher. « Capturing JUnit Behavior into Static Programs : Static Testing Framework ». Thesis, Linnaeus University, School of Computer Science, Physics and Mathematics, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-5510.

Texte intégral

Résumé :

In this research paper, it evaluates the benefits achievable from static testing framework by analyzing and transforming the JUnit3.8 source code and static execution of transformed code. Static structure enables us to analyze the code statically during creation and execution of test cases. The concept of research is by now well established in static analysis and testing development. The research approach is also increasingly affecting the static testing process and such research oriented work has proved particularly valuable for those of us who want to understand the reflective behavior of JUnit3.8 Framework.

JUnit3.8 Framework uses Java Reflection API to invoke core functionality (test cases creation and execution) dynamically. However, Java Reflection API allows developers to access and modify structure and behavior of a program. Reflection provides flexible solution for creating test cases and controlling the execution of test cases. Java reflection helps to encapsulate test cases in a single object representing the test suite. It also helps to associate each test method with a test object. Where reflection is a powerful tool to perform potential operations, on the other hand, it limits static analysis. Static analysis tools often cannot work effectively with reflection.

In order to avoid the reflection, Static Testing Framework provides a static platform to analyze the JUnit3.8 source code and transform it into non-reflective version that emulates the dynamic behavior of JUnit3.8. The transformed source code has possible leverage to replace reflection with static code and does same things in an execution environment of Static Testing Framework that reflection does in JUnit3.8. More besides, the transformed code also enables execution environment of Static Testing Framework to run test methods statically. In order to measure the degree of efficiency, the implemented tool is evaluated. The evaluation of Static Testing Framework draws results for different Java projects and these statistical data is compared with JUnit3.8 results to measure the effectiveness of Static Testing Framework. As a result of evaluation, STF can be used for static creation and execution of test cases up to JUnit3.8 where test cases are not creating within a test class and where real definition of constructors is not required. These problems can be dealt as future work by introducing a middle layer to execute test fixtures for each test method and by generating test classes as per real definition of constructors.

Styles APA, Harvard, Vancouver, ISO, etc.

27

Bentakouk, Lina. « Test symbolique de services web composite ». Phd thesis, Université Paris Sud - Paris XI, 2011. http://tel.archives-ouvertes.fr/tel-00675918.

Texte intégral

Résumé :

L'acceptation et l'utilisation des services Web en industrie se développent de par leursupport au développement d'application distribuées comme compositions d'entitéslogicielles plus simples appelées services. En complément à la vérification, le testpermet de vérifier la correction d'une implémentation binaire (code source nondisponible) par rapport à une spécification. Dans cette thèse, nous proposons uneapproche boîte-noire du test de conformité de compositions de services centralisées(orchestrations). Par rapport à l'état de l'art, nous développons une approchesymbolique de façon à éviter des problèmes d'explosion d'espace d'état dus à la largeutilisation de données XML dans les services Web. Cette approche est basée sur desmodèles symboliques (STS), l'exécution symbolique de ces modèles et l'utilisationd'un solveur SMT. De plus, nous proposons une approche de bout en bout, quiva de la spécification à l'aide d'un langage normalisé d'orchestration (ABPEL) etde la possible description d'objectifs de tests à la concrétisation et l'exécution enligne de cas de tests symboliques. Un point important est notre transformation demodèle entre ABPEL et les STS qui prend en compte les spécifications sémantiquesd'ABPEL. L'automatisation de notre approche est supportée par un ensemble d'outilsque nous avons développés.

Styles APA, Harvard, Vancouver, ISO, etc.

28

Rafi, Dudekula Mohammad, et Kiran Moses Katam Reddy. « Automated Software Testing : A Study of the State of Practice ». Thesis, Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-3375.

Texte intégral

Résumé :

Context: Software testing is expensive, labor intensive and consumes lot of time in a software development life cycle. There was always a need in software testing to decrease the testing time. This also resulted to focus on Automated Software Testing (AST), because using automated testing, with specific tools, this effort can be dramatically reduced and the costs related with testing can decrease [11]. Manual Testing (MT) requires lot of effort and hard work, if we measure in terms of person per month [11]. Automated Software testing helps to decrease the work load by giving some testing tasks to the computers. Computer systems are cheap, they are faster and don‘t get bored and can work continuously in the weekends. Due to this advantage many researches are working towards the Automation of software testing, which can help to complete the task in less testing time [10]. Objectives: The main aims of this thesis is to 1.) To systematically classify contributions within AST. 2.) To identify the different benefits and challenges of AST. 3.) To identify the whether the reported benefits and challenges found in the literature are prevalent in industry. Methods: To fulfill our aims and objectives, we used Systematic mapping research methodology to systematically classify contributions within AST. We also used SLR to identify the different benefits and challenges of AST. Finally, we performed web based survey to validate the finding of SLR. Results: After performing Systematic mapping, the main aspects within AST include purpose of automation, levels of testing, Technology used, different types of research types used and frequency of AST studies over the time. From Systematic literature review, we found the benefits and challenges of AST. The benefits of AST include higher product quality, less testing time, reliability, increase in confidence, reusability, less human effort, reduction of cost and increase in fault detection. The challenges include failure to achieve expected goals, difficulty in maintenance of test automation, Test automation needs more time to mature, false expectations and lack of skilled people for test automation tools. From web survey, it is observed that almost all the benefits and challenges are prevalent in industry. The benefits such as fault detection and confidence are in contrary to the results of SLR. The challenge about the appropriate test automation strategy has 24 % disagreement from the respondents and 30% uncertainty. The reason is that the automation strategy is totally dependent on the test manager of the project. When asked “Does automated software testing fully replace manual testing”, 80% disagree with this challenge. Conclusion: The classification of the AST studies using systematic mapping gives an overview of the work done in the area of AST and also helps to find research coverage in the area of AST. These results can be used by researchers to use the gaps found in the mapping studies to carry on future work. The results of SLR and web survey clearly show that the practitioners clearly realize the benefits and challenges of AST reported in the literature.
Mobile no: +46723069909

Styles APA, Harvard, Vancouver, ISO, etc.

29

Nyussupov, Adlet. « Using Autonomous Agents for Software Testing Based on JADE ». Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-45319.

Texte intégral

Résumé :

The thesis work describes the development of a multiagent testing application (MTA) based on an agent approach for solving challenges in regression testing domain, such as: reducing the complexity of testing, optimizing the time consumption, increasing the efficiency and implementing the automation of this approach for regression testing. All these challenges related to effectiveness and cost, can be represented as measures of achieved code coverage and number of test cases created. A multiagent approach is proposed in this thesis since it allows the implementation of the autonomous behaviour and optimizes the data processing in a heterogeneous environment. In addition, the agent-based approach provides flexible design methods for building multitask applications and conducting parallel task execution. However, all of these advantages of using an agent-based approach need to be investigated in the regression testing domain for realistic scenarios. Therefore, a hypothesis was formulated in order to investigate the efficiency of the MTA approach using an experiment as the main research method for obtaining results. The thesis includes a comparison analysis between the MTA and well-known test case generation tools (i.e. EvoSuite and JUnitTools) for identifying the differences in terms of efficiency and code coverage achieved. The comparison results showed advantages of the MTA within regression testing context due to optimal level of code coverage and test cases. The outcome of the thesis work moves toward solving the aforementioned problems in regression testing domain and shows some advantages of using the multagent approach within regression testing context.

Styles APA, Harvard, Vancouver, ISO, etc.

30

Narciso, Everton Note. « Seleção de casos de teste para sistemas de processamento de imagens utilizando conceitos de CBIR ». Universidade de São Paulo, 2013. http://www.teses.usp.br/teses/disponiveis/100/100131/tde-25112014-160734/.

Texte intégral

Résumé :

Os sistemas de processamento de imagens exercem um papel importante no que tange à emulação da visão humana, pois grande parte das informações que as pessoas obtêm do mundo real ocorre por meio de imagens. Desenvolver tais sistemas é uma tarefa complexa e que requer testes rigorosos para garantir a sua confiabilidade. Neste cenário, a seleção de casos de teste é fundamental, pois ajuda a eliminar os dados de teste redundantes e desnecessários enquanto procura manter altas taxas de detecção de erros. Na literatura há várias abordagens para seleção de casos de teste com foco em sistemas de entradas/saídas alfanuméricas, mas a seleção voltada a sistemas complexos (e.g. processamento de imagens) ainda é pouco explorada. Visando a contribuir neste campo de pesquisa, este trabalho apresenta um novo método intitulado Tcs&CbIR, que seleciona e recupera um subconjunto de imagens a partir de um vasto conjunto de teste. Os testes realizados com dois programas de processamento de imagens mostram que a nova abordagem pode superar a seleção aleatória pois, no contexto de avaliação apresentado, a quantidade de casos de teste necessária para revelar a presença de erros foi reduzida em até 87%. Os resultados obtidos revelam, também, o potencial da utilização de CBIR para abstração de informações, a importância da definição de extratores de características adequados e a influência que as funções de similaridade podem exercer na seleção de casos de teste.
Image processing systems play a key role when it comes to emulation of human vision, because much of the information that humans capture from the real world occurs through images. Developing such systems is a complex task that requires rigorous testing to ensure their quality and reliability. In this scenario, the test case selection is crucial because it helps to eliminate the redundant and unnecessary test data while it tries to maintain high rates of error detection. In the literature there are several approaches for test cases selection with a focus on systems with alphanumeric inputs and outputs, but the selection focused on complex systems (e.g. image processing) is still unexplored. Aiming to contribute to this research field, this work presents a new method entitled Tcs&CbIR, which selects and retrieves a subset of images from a wide test suite. Tests conducted with two image processing programs show that the new approach can overcome the random selection because, in the context of evaluation presented, the amount of test cases required to detect the presence of the errors was reduced by up to 87%. The results also show the potential use of CBIR for information abstraction, the importance of the definition of suitable extractors of characteristics and the influence of the similarity functions in the test case selection.

Styles APA, Harvard, Vancouver, ISO, etc.

31

Oliveira, André Assis Lôbo de. « Uma abordagem coevolucionária para seleção de casos de teste e programas mutantes no contexto do teste de mutação ». Universidade Federal de Goiás, 2013. http://repositorio.bc.ufg.br/tede/handle/tede/3298.

Texte intégral

Résumé :

Submitted by Jaqueline Silva (jtas29@gmail.com) on 2014-10-06T17:24:11Z No. of bitstreams: 2 Dissertação - André Assis Lôbo de Oliveira- 2013.pdf: 3915731 bytes, checksum: 2447fa437e5dca74e295727bd8fed4d1 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)
Approved for entry into archive by Jaqueline Silva (jtas29@gmail.com) on 2014-10-06T19:18:43Z (GMT) No. of bitstreams: 2 Dissertação - André Assis Lôbo de Oliveira- 2013.pdf: 3915731 bytes, checksum: 2447fa437e5dca74e295727bd8fed4d1 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)
Made available in DSpace on 2014-10-06T19:18:43Z (GMT). No. of bitstreams: 2 Dissertação - André Assis Lôbo de Oliveira- 2013.pdf: 3915731 bytes, checksum: 2447fa437e5dca74e295727bd8fed4d1 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Previous issue date: 2013-12-05
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES
Verification and Validation Activities (V&V) consume about 50% to 60% of the total cost of a software lifecycle. Among those activities, Software Testing technique is one which is mostly used during this process. One of the main problems related to detected in Software Testing is to find a set of tests (subset from input domain of the problem) which is effective to detect the remaining bugs in the software. The Search-Based Software Testing (SBST) approach uses metaheuristics to find low cost set of tests with a high effectiveness to detect bugs. From several existing test criteria, Mutation Testing is considered quite promising to reveal bugs, despite its high computational cost, due to the great quantity of mutant programs generated. Therefore, this dissertation addresses the problem of selecting mutant programs and test cases in Mutation Testing context. To this end, it is proposed a Coevolutionary Genetic Algorithm (CGA) and the concept of Genetic Effectiveness, implemented by Genetic Classification (GC) and new genetic operators adapted to the proposed representation. Furthermore, the Genetic Algorithm Coevolutionary with Controlled Genetic Classification (CGA􀀀CGCop) is proposed for improving the efficiency of CGA’s GC. The CGA is applied in three categories of benchmarks and compared to other five methods. The results show a better performance of the CGA in subsets selection with better mutation score, as well as improvement of CGA􀀀CGCop in use of GC. These results evidence the proposal approach with promising use in the context of Mutation Testing.
Atividades de Validação e Verificação (V&V) consomem cerca de 50% a 60% do custo total no ciclo de vida de um software. Dentre essas, o Teste de Software é uma das atividades mais empregadas. Um dos maiores problemas do Teste de Software é encontrar um conjunto de teste (subconjunto do domínio de entrada do problema) que seja eficaz em detectar os defeitos remanescentes no software. Neste contexto, a Search-Based Software Testing (SBST) é uma linha de pesquisa recente que vem propondo boas soluções, uma vez que utiliza-se de metaheurísticas para encontrar um conjunto de teste com baixo custo e grande eficácia na detecção de defeitos. Dentre os diversos critérios de teste existentes, o Teste de Mutação é bastante promissor na revelação de defeitos, entretanto apresenta um alto custo computacional em termos de aplicabilidade. Por isso, a pesquisa aborda o problema de seleção de programas mutantes e casos de teste no contexto do Teste de Mutação. Para tal, propõe o Algoritmo Genético Coevolucionário (AGC) que traz o conceito de Efetividade Genética, implementado pela Classificação Genética (CG) e por novos operadores genéticos adaptados à representação proposta. Além disso, propõe o Algoritmo Genético Coevolucionário com Classificação Genética Controlada (AGC 􀀀CGCop) para a melhoria da eficiência da CG do AGC. O algoritmo AGC é aplicado em três classes de benchmarks e comparado com outros cinco métodos. Os resultados demonstram um melhor desempenho do AGC na seleção de subconjuntos com melhor escore de mutação, bem como um aprimoramento do AGC􀀀CGCop no uso da CG. Tais resultados evidenciam a abordagem proposta com uso promissor no contexto do Teste de Mutação.

Styles APA, Harvard, Vancouver, ISO, etc.

32

Machado, Bruno Nunes. « SBSTFrame : um framework para teste de software baseado em busca ». Universidade Federal de Goiás, 2016. http://repositorio.bc.ufg.br/tede/handle/tede/6345.

Texte intégral

Résumé :

Submitted by Luciana Ferreira (lucgeral@gmail.com) on 2016-10-04T12:46:23Z No. of bitstreams: 2 Dissertação - Bruno Nunes Machado - 2016.pdf: 954291 bytes, checksum: 2b4b0a80a709d8803e7d0857e9aad0dd (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2016-10-04T12:46:59Z (GMT) No. of bitstreams: 2 Dissertação - Bruno Nunes Machado - 2016.pdf: 954291 bytes, checksum: 2b4b0a80a709d8803e7d0857e9aad0dd (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
Made available in DSpace on 2016-10-04T12:46:59Z (GMT). No. of bitstreams: 2 Dissertação - Bruno Nunes Machado - 2016.pdf: 954291 bytes, checksum: 2b4b0a80a709d8803e7d0857e9aad0dd (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2016-09-01
Fundação de Amparo à Pesquisa do Estado de Goiás - FAPEG
The software testing is an important component of software development life cycle, that directly affects quality of software products. Some problems in software testing phase can not be optimized only with traditional Software Engineering techniques. It is possible to do the mathematical modelling of those problems in an attempt to optimize them through the search techniques. However, the use of optimization approaches tend to incorporate more and more activities decisions to the tester, making more complex test activity. So, in order that optimization techniques are in fact employed at the Software Test solutions, the ability to abstract the details of optimization are required. Thus, the objective of this research is to propose a framework for search-based software testing (SBST). The proposed framework works as a top-level layer over generic optimization frameworks and testing software tools, it's target is supporting software testers that are not able to use optimization frameworks during a testing activity due to short deadlines and limited resources or skills, also supporting expert or beginners users from optimization area that need or want to compare their metaheuristics with ones from literature and offered by the proposed framework. The framework was evaluated in a case study of software testing scenario. This scenario was modeled as test case selection problem in which experiments were executed with different metaheuristics and benchmarks offered by framework. The results indicate it's capability to support the SBST area with emphasis on the test cases selection. The framework was evaluated and compared with other SBST frameworks in terms of quality metrics, that indicated its extensibility and flexibility as framework.
O Teste de Software é uma parte essencial do processo de desenvolvimento de software, com impacto direto na qualidade do produto de software. Alguns problemas detectados durante a fase de teste de software não são possíveis de serem resolvidos apenas com as técnicas tradicionais da Engenharia de Software. Nestes casos é possível realizar a modelagem matemática desses problemas e tentar otimizá-los por meio das técnicas de busca. Entretanto, a utilização de abordagens de otimização tende a incorporar mais decisões e mais atividades para o testador, tornando a atividade de teste mais complexa. Assim, para que as técnicas de otimização sejam de fato empregadas no Teste de Software, soluções com a capacidade de abstrair detalhes da otimização são necessárias. Diante disso, o objetivo desta pesquisa consiste em propor um framework para apoiar o Teste de Software Baseado em Busca. O framework proposto funciona como uma camada de alto nível sobre os frameworks genéricos de otimização e as ferramentas de teste de software, apoiando testadores de software que não são capazes de utilizar os frameworks de otimização durante uma atividade de teste devido a prazos curtos e recursos ou habilidades limitadas, além de apoiar usuários iniciantes ou especialistas da área de otimização que precisam ou desejam comparar suas metaheurísticas ou heurísticas com as da literatura e as oferecidas pelo framework proposto. O framework foi avaliado em um estudo de caso no cenário de teste de software. Tal cenário foi modelo como um problema de seleção de casos de teste, em que experimentos foram executados com diferentes metaheurísticas e benchmarks oferecidos pelo framework. Os resultados indicaram a capacidade do framework em apoiar a aréa de SBST, com destaque para o problema de seleção de casos de teste. Além disso, o framework também foi avaliado e comparado com outro framework SBST em termos de métricas de qualidade, que indicaram a extensibilidade e flexibilidade do framework proposto.

Styles APA, Harvard, Vancouver, ISO, etc.

33

CARNEVALI, LAURA. « Formal methods in the development life cycle of real-time software ». Doctoral thesis, 2010. http://hdl.handle.net/2158/521924.

Texte intégral

Résumé :

Preemptive Time Petri Nets (pTPNs) support modeling and analysis of concurrent timed software components running under fixed priority preemptive scheduling. The model is supported by a well established theory based on symbolic state-space analysis through Difference Bounds Matrix (DBM), with specific contributions on compositional modularization, trace analysis, and efficient over-approximation and clean-up in the management of suspension deriving from preemptive behavior. The aim of this dissertation is to devise and implement a framework that brings the theory to application. To this end, the theory is cast into an organic tailoring of design, coding, and testing activities within a V-Model software life cycle in respect of the principles of regulatory standards applied to the construction of safety-critical software components. To implement the toolchain subtended by the overall approach into a Model Driven Development (MDD) framework, the theory of state-space analysis is complemented with methods and techniques supporting semi-formal specification and automated compilation into pTPN models and real-time code, measurement-based Execution Time estimation, test-case selection and sensitization, coverage evaluation.

Styles APA, Harvard, Vancouver, ISO, etc.

34

Afonso, Miguel Alexandre Nunes. « Selection of heterogeneous test environments for the execution of automated tests ». Master's thesis, 2016. http://hdl.handle.net/10400.6/7724.

Texte intégral

Résumé :

As software complexity grows so does the size of automated test suites that enable us to validate the expected behavior of the system under test. When that occurs, problems emerge for developers in the form of increased effort to manage the test process and longer execution time of test suites. Manual managing automated tests is especially problematic, as the recurring costa of guaranteeing that the automated tests (e.g.: thousands) are correctly configured to execute on the available test environments (e.g.: dozens or hundreds), on a regular basis and during the products lifetime may become huge, with unbearable human effort involved. This problem increases substantially when the system under test is one highly configurable product, requiring to be validated in heterogeneous environments, especially when these target test environments also evolve frequently (e.g.: new operating systems, new browsers, new mobile devices, ...). Being an integral part of software development, testing needs to evolve and break free from the conventional methods. This dissertation presents a technique that extends one existent algorithm to reduce the number of test executions, and extend it, enabling to perform the test case distribution over multiples heterogeneous test environments. The development, implementation and validation of the technique presented in this dissertation were conducted in the industrial context of an international software house. Real development scenarios were used to conduct experiments and validations, and the results demonstrated that the proposed technique is effective in terms of eliminating the human effort involved in test distribution.
À medida que a complexidade do software aumenta o mesmo acontece com a dimensão das suites de testes automizados que permitem validar o comportamento esperado do sistema que está a ser testado. Quando isso ocorre, aparecem problemas para os programadores sob a forma de aumento de esforço necessário para gerir o processo de teste e maior tempo de execução das suites de teste. Gerir manualmente milhares de testes automatizados é especialmente problemático uma vez que os custos recorrentes de garantir que os testes automatizados (ex: milhares) estão corretamente configurados para executar nos ambientes de testes disponíveis (ex: dezenas ou centennas), durante o tempo de vida dos produtos pode tornar-se gigantesco. Este problema aumenta substancialmente quando o sistema que está a ser testado é um produto altamente configurável, precisando de ser validado em ambientes heterogéneos, especialmente quando também estes ambientes destino de testes também evoluem frequentemente (ex: novos sistemas operativos, novos browsers, novos devices móveis, ...). O tempo de execução destas suites de testes torna-se também um problema enorme, dado que não é viável executar todos as suites de testes em todas as configurações possiveis. Sendo uma parte integral do desenvolvimento de software, a forma de testar precisa de evoluir e libertar-se dos métodos convencionais. Esta dissertação apresenta uma técnica que estende um algoritmo existente que permite reduzir o número de execuções de testes, e estende-o, permitindo fazer a distribuição de casos de teste sobre múltiplos ambientes de teste heterogéneos. O desenvolvimento, implementação e validação da técnica proposta na presente dissertação foram conduzidos no contexto industrial de uma empresa internacional de desenvolvimento de software. Foram utilizados cenários de desenvolvimento de software reais para conduzir experiências e validações, e os resultados demonstraram que a técnica proposta é eficaz em termos de eliminar o esforo humano envolvido na distribuição de testes.

Styles APA, Harvard, Vancouver, ISO, etc.

35

Siddiquee, Shoukat Hayat. « Timed test case execution for distributed real-time systems ». Thesis, 2005. http://spectrum.library.concordia.ca/8724/1/MR14282.pdf.

Texte intégral

Résumé :

A real-time system is a system that is required to react to stimuli from the environment (including the passage of physical time) within time intervals dictated by the environment. In real-time applications, the timing requirements are the main constraints and their mastering is the predominant factor for assessing the quality of service. We proposed two methods for timed test case execution for distributed real time systems modeled as TIOA. Ensuring the correctness of real time systems before the development and guaranteeing that it functions correctly within the specified time constraints are very critical to avoid catastrophic consequences. A number of design issues affect the testing strategies and the testability of the system. Existing methods of distributed test systems still have some drawbacks. Firstly, there is lack of coordination among local testers in a distributed system. Secondly, the centralized test method may result in performance problems, due to the fact that all TS-IUT interactions are achieved through the network. With an aim to alleviate the shortcomings, we developed a Synchronizer in centralized test system, which would control and coordinate the local testers in the test environment. We implemented these methods and tested them with a benchmark of real life automata model by using CORBA distributed architecture. As a result, the performance problem has been reduced in both methodologies. We distinguished between two methodologies and compare their performances in terms of functionalities, based on our implementation and illustrate their approaches using Train-Gate-Controller case study

Styles APA, Harvard, Vancouver, ISO, etc.

36

Li, Wen-Chi, et 李文棋. « Tool Support for Test Case Selection ». Thesis, 2005. http://ndltd.ncl.edu.tw/handle/y6ehfv.

Texte intégral

Résumé :

碩士
國立臺北科技大學
資訊工程系所
93
During the development of software project, regression test can guarantee the function that is already finished will not be affected after program revision. Since regression test is to execute existing tests repeatedly, the executing time of test cases will increases as the number of test cases increases, which implies the developer have to wait longer for the test to complete. In continuous-integration software development, longer waiting time for test execution will certainly interrupt the development process and is unfavorable to do continuous integration immediately. If we can select test cases referenced to the modified program from existing tests, we can reduce the waiting time of regression testing significantly. This thesis puts forward several practical test selection strategies which match and choose the relational operations in testing, and can help the developer to screen test cases needed automatically. We develop a tool that supports test case selection and applies these strategies for test cases screening. The developer can specify filtering condition by himself to achieve the merit of customization. We hope that by choosing test cases and executing regression test efficiently, the productivity and the quality of software can be significantly improved.

Styles APA, Harvard, Vancouver, ISO, etc.

37

Lee, Jen-Gaw, et 李正國. « A Study of Optimal Test Case Selection Problem ». Thesis, 2000. http://ndltd.ncl.edu.tw/handle/92995149359331324785.

Texte intégral

Résumé :

博士
國立交通大學
資訊工程系
88
The optimal test case selection problem is to select the minimal number of test cases satisfying a required coverage criterion. Many studies dealing with the optimal test case selection problem are available. However, these studies suffer the following drawbacks: 1.Applying existing optimal path set selection methods to a complicated procedure-oriented program, the path set derived may not be optimal in some stage(s). 2.Existing test case set selection methods in regression testing can not ensure that the test case set found is optimal. 3.The optimal test case selection problem in object-oriented (OO) program testing is rarely discussed. The goal of this research is to propose some methods to solve the above three drawbacks. The first drawback is caused by that the existing optimal path set selection methods do not consider the subsumption relation of coverage criteria. If a coverage criterion C1 is subsumed by another coverage criterion C2, the optimal path set P1 satisfying C1 should satisfy partial set of components of C2. So this dissertation proposes to find the optimal path set from the remaining unselected paths to satisfy the remaining uncovered components of C2, the union of the obtained optima path set and P1 will contain the minimal number of untested paths to satisfy C2. Finding a minimal subset of a test suite to satisfy the requirements of the regression testing is referred to as optimal representative set selection problem. Both the optimal representative set selection problem and the optimal path set selection problem are equivalent to solving the set-covering problem, so this dissertation proposes to adapt the enhanced zero-one optimal path set selection method to find the optimal representative set for the regression testing. If an OO program is executed by only one thread, this program is considered as a sequential OO program. Otherwise, it is a concurrent OO program. Sequential OO programs are usually tested by bottom-up approach which tests a class at a time and tests used (or base) class before using (or derived) class. Since the number of paths of a method is usually small and the path set of a method is disjoint with the path set of another method, it is not meaningful to discuss the optimal path set selection problem of a class. Similarly, the path set of a class is disjoint with the path set of another class, so it is not meaningful to discuss the optimal path set selection problem of sequential OO program. To discuss the optimal path set selection problem of a concurrent OO program, we should know the test cases of this program first. However, no concurrent OO program testing method is available now. This dissertation proposes a two-step plus bottom-up method to test concurrent Java program first. Based on this method, the test cases include path sets to test classes, the main() method, and run() methods of active classes, and concurrent paths to test inter-thread interaction behavior of the concurrent Java program. It is not meaningful to discuss optimal path set selection problem of a class, the main() method, or a run() method. However, this dissertation proposes to apply the enhanced zero-one optimal path set selection method to find the minimal number of concurrent paths to satisfy a criterion.

Styles APA, Harvard, Vancouver, ISO, etc.

38

Yu, Tung-Hsung, et 余東欣. « Test Case Ordering and Selection for Blackbox Testing ». Thesis, 2012. http://ndltd.ncl.edu.tw/handle/59826718634929901147.

Texte intégral

Résumé :

碩士
中原大學
工業與系統工程研究所
100
With the trend toward rapid product development and customization in today’s software industry, it is becoming a critical issue that software products must be quickly made available to customers or consumers. Before the products can shipped to customers, “software testing” must be included to ensure the quality of software. However, software test cases, designed to catch errors, are typically executed with limited resources, especially time and budgets. This study will investigate test case ranking through the prioritization technique and selection of test cases to help minimize the resource issues. In previous literatures, software testing can be categorized into test case reduction, test case selection and test case prioritization. Few researchers investigate software testing from the perspective of combined topics from several categories. This study proposes the test case ranking in term of prioritization, severity and time under the black-box test environment and then uses Total Requirement Selection (TRS) method to divide ranked test cases into two test suites, primary and secondary, depending on the time constraint. According to practical results from the proposed methodology, the proposed method provides an efficient test case combination in terms of execution time as well as test case severity.

Styles APA, Harvard, Vancouver, ISO, etc.

39

Lin, Jhih-Yu, et 林芝妤. « Test Case Selection and Scheduling Based on Requirement Coverage ». Thesis, 2014. http://ndltd.ncl.edu.tw/handle/dtp6e9.

Texte intégral

Résumé :

碩士
中原大學
工業工程研究所
102
This paper considers the test suite reduction problem which uses requirements coverage as test adequacy criteria and multiple testers scheduling problem with test case precedence constraints. The objective is to minimize the test completion time by determining the allocation and sequence of test cases on multiple testers. Follow-up on discuss how the requirements coverage affects the performance of the test completion time. Cuckoo search is a newly developed meta-heuristic algorithm was only proposed in few studies to solve optimization problem. Therefore in the paper cuckoo search is proposed to solve this problem. In previous literatures, the relationship between the difference in require-ments coverage and the test completion time is rarely discussed. In order to find the most suitable requirements coverage which has the maximum effectiveness from reducing test completion time, experiments with different requirements coverage were conducted. Computational experiments are executed and the results show that the proposed cuckoo search yields better solutions in comparison with the simulation annealing algorithm and ran-dom selection algorithm. Finally, the result of most suitable requirements coverage shows that when the ratio comes to 95%, it can save almost 30% of the test completion time.

Styles APA, Harvard, Vancouver, ISO, etc.

40

Babakhani, Mohammad Reza. « Implementation of an Automation System to Support Test Case Execution and Classification for Electrical Tests ». 2019. https://monarch.qucosa.de/id/qucosa%3A36119.

Texte intégral

Résumé :

In recent years, automotive engineering becomes more challenging and complex than previous years because of the innovation that transformed the cars powertrain system. By the quick developing of the automotive systems and increasing the consumer demand for Hybrid Vehicles (HV), Electric Vehicles (EV) and Autonomous cars, authenticity and security of engine systems are an essential part. The Hybrid Electric Vehicle structure contained several system sections like Electric Motor, Inverter, DC-DC Converter, etc. For testing this device, OEM’s are providing a special automotive standard norm (these norms are individually defining by automotive companies as LV124/123/148) which used for simulates variety of the electrical disturbances and monitoring the system behavior. This standard profile applies, simulates and records by EM Autowave system. Electrical tests have been done for a long time manually. Manual testing takes a huge amount of time, money and human resources. Based on the facts, the thesis purpose is to provide the automated system test for supporting test case execution on the HEV test bench, and offline classification independent of the test bench. This scope of the project will be developed by adapting automation library which is going to equip new features for automation system tool. On the other hand, in order to conform the test simulator and their communication system, a device file is implemented for loading and testing the electrical profiles on the test bench system. In addition, automated classification and evaluation used Matlab functions and the test result will be provided as plots which makes differential discovering very easier.

Styles APA, Harvard, Vancouver, ISO, etc.

41

Sung, Jung-Chun, et 宋榮浚. « Test Case selection and distribution for multi tester to minimize makespan ». Thesis, 2013. http://ndltd.ncl.edu.tw/handle/49428884775589335462.

Texte intégral

Résumé :

碩士
中原大學
工業與系統工程研究所
101
Software testing is an important stage in software development life cycle. Yet software testing is both time-consuming and resource-intensive. Additionally, software testing is usually resource and time limited. Designing Test Case to find software defects errors and shortening the software testing time have become important research directions. Currently, most literatures focus on the testing environment for a single software tester and rarely explore testing in a collaborative environment. This study focuses on requirements factor for test case reduction, combined with dispatching scheduling to simulate the multi-tester test environment. This study arranges test cases through the test case minimization and classification according their hierarchy of importance. Next, test cases are distributed to multi-testers. This study compares several heuristics. Experimental results indicate that the testing time is shortened for software testing. Furthermore, with 5% requirement reduction the testing time can be reduced significantly for software testing.

Styles APA, Harvard, Vancouver, ISO, etc.

42

Hung, Chih-Chung, et 洪志忠. « A Debugging Tool based on Debugging History Management and Test Case Selection ». Thesis, 2008. http://ndltd.ncl.edu.tw/handle/4w7q8k.

Texte intégral

Résumé :

碩士
國立臺北科技大學
資訊工程系研究所
96
Running automated test case to ensure that every modification will not cause new defects is a well-known software best practice. This approach can also be applied to debugging activities so that reduces the verification time. But with the growth of software system, the complexity of programs and the number of test cases are also increased. It may lead to: (1) developers may loss focus by unrelated test cases because of too many test cases; (2) developers need to endure longer test time, and therefore decrease performance; (3) During the debugging activity, developers often need to repeatedly modify programs, and many of the modifications may be finally proved that they have nothing to do with the bug, so we need to spend time to rollback; (4) because the debugging process and experience are usually not retained, the other members of the development team are difficult to learn the experience. In view of this, this paper presents debugging history and focus group concepts, storing modification history and using a test case selection technique to selects test cases related to the bug, in order to resolve the above issues. We have developed an Eclipse plug-ins, Reg4J2, to implement the concepts. By integrating with the Eclipse platform, Reg4J2 will be easier to be integrated with development activities and help developers to debug.

Styles APA, Harvard, Vancouver, ISO, etc.

43

tsai, Martin, et 蔡佳憲. « Selection of Manufacturing Execution System Vendor Using an Analytic Hierarchy Process Approach—A Case Study of S Company ». Thesis, 2016. http://ndltd.ncl.edu.tw/handle/jr62jb.

Texte intégral

Résumé :

碩士
國立臺灣科技大學
工業管理系
105
The concept of “Industry 4.0” was first unveiled at the 2011 Hanover Fair in Germany. Following in its footstep, the Executive Yuan presented its “Productivity 4.0 Development Solution” in 2015. Factory production today has evolved from traditional dashboard management with mass production via assembly lines, into low-quantity, highly-customized and smart factory systems with human-machine networks. As such, manufacturing execution systems (MES) have come to play a crucial role in information collection, analysis and exchange. Through the console network functionality that works in conjunction with production information collection, feedback and correction, such systems are capable of assisting production site managers in achieving optimal productivity and consistent quality. The purpose of this study is to evaluate information service providers that have adopted MES by using the modified Delphi method (MDM) to determine the key factors in the selection process. A group of experts were asked to complete a questionnaire to determine 4 major dimensions and 13 factors for the appraisal process. The analytic hierarchy process (AHP) was then performed to compute relevant weights at different tiers of the hierarchy and to validate the consistency. The results of the study show that the most critical dimension for information service provider selection is quality, followed by functionality, service, and technology. The results of this study should serve as a useful reference for the selection of information service providers by management and project teams in Company S.

Styles APA, Harvard, Vancouver, ISO, etc.

44

Lin, Tzu-Hsiang, et 林子翔. « Application of Genetic Algorithm on Test Case Selection against State Coverage of Kernel Code ». Thesis, 2010. http://ndltd.ncl.edu.tw/handle/59183839783775356339.

Texte intégral

Résumé :

碩士
臺灣大學
電子工程學研究所
98
We propose kernel code coverage analysis on model testing instead of testing on user application software, system software, and perform the testing on generating the commands in command line interfaces. In our approach, we can gain much higher coverage ratio than the used testing approach. We also can save more testing time or testing cost and save important information or error message when system crash occurs. We also propose an approach use a genetic algorithm to find a appropriate way to clustering those test cases, so that testers don’t need to run every test case; they just pick few test cases from every cluster to run, and they can evaluate the whole test case bases will gain how much coverage ratio. For the same target, there is no need to train again, we can just follow the rule we have found to clustering. Our technique provides a more efficient and more accurate way to analyze coverage ratio.

Styles APA, Harvard, Vancouver, ISO, etc.

45

Wei, Jiawei. « Secondary Analysis of Case-Control Studies in Genomic Contexts ». Thesis, 2010. http://hdl.handle.net/1969.1/ETD-TAMU-2010-08-8269.

Texte intégral

Résumé :

This dissertation consists of five independent projects. In each project, a novel statistical method was developed to address a practical problem encountered in genomic contexts. For example, we considered testing for constant nonparametric effects in a general semiparametric regression model in genetic epidemiology; analyzed the relationship between covariates in the secondary analysis of case-control data; performed model selection in joint modeling of paired functional data; and assessed the prediction ability of genes in gene expression data generated by the CodeLink System from GE. In the first project in Chapter II we considered the problem of testing for constant nonparametric effects in a general semiparametric regression model when there is the potential for interaction between the parametrically and nonparametrically modeled variables. We derived a generalized likelihood ratio test for this hypothesis, showed how to implement it, and gave evidence that it can improve statistical power when compared to standard partially linear models. The second project in Chapter III addressed the issue of score testing for the independence of X and Y in the second analysis of case-control data. The semiparametric efficient approaches can be used to construct semiparametric score tests, but they suffer from a lack of robustness to the assumed model for Y given X. We showed how to adjust the semiparametric score test to make its level/Type I error correct even if the assumed model for Y given X is incorrect, and thus the test is robust. The third project in Chapter IV took up the issue of estimation of a regression function when Y given X follows a homoscedastic regression model. We showed how to estimate the regression parameters in a rare disease case even if the assumed model for Y given X is incorrect, and thus the estimates are model-robust. In the fourth project in Chapter V we developed novel AIC and BIC-type methods for estimating the smoothing parameters in a joint model of paired, hierarchical sparse functional data, and showed in our numerical work that they are many times faster than 10-fold crossvalidation while at the same time giving results that are remarkably close to the crossvalidated estimates. In the fifth project in Chapter VI we introduced a practical permutation test that uses cross-validated genetic predictors to determine if the list of genes in question has “good” prediction ability. It avoids overfitting by using cross-validation to derive the genetic predictor and determines if the count of genes that give “good” prediction could have been obtained by chance. This test was then used to explore gene expression of colonic tissue and exfoliated colonocytes in the fecal stream to discover similarities between the two.

Styles APA, Harvard, Vancouver, ISO, etc.

46

Lee, Chih-Chieh, et 李之傑. « An exploratory study on manufacturing execution system Knowledge management of semiconductor assembly and test industry — A case study on T company ». Thesis, 2005. http://ndltd.ncl.edu.tw/handle/8u7hug.

Texte intégral

Résumé :

碩士
中原大學
資訊管理研究所
93
Semiconductor assembly and testing industrials business services focus on Wafer probing､back grinding､wafer sawing､assembly and testing. In order to help production management, the industrials usually implement Manufacturing Execution System (MES) which can improve these functionalities as below, such as Production Definition Management､Operation Process､Workstation Management､Work Order Management､Equipment Maintenance､Capacity Planning､Material Movement and Production Statistic Quality Control and so on as the infrastructure, the system. The aim of research is to approve the importance on the MES and how more effective help production management. Therefore, this research exploratory study on manufacturing execution system Knowledge management of semiconductor assembly and test industry, wants to inquire into the manufacturing execution system knowledge management themes, discuss how knowledge management activities can help to resolve manufacturing execution system problem, and knowledge management functionalities discussion. This research adopts the case study methodology, to a domestic semiconductor assembly and test company, The theory framework is established by consolidating knowledge management and manufacturing execution system literatures and divided into two main parts. First stage research, to revise the theory frame through expert interview, then built up the conceptual frame. Second stage research, is verify the conceptual frame through questionnaire approach. This research exploratory study on manufacturing execution system Knowledge management of semiconductor assembly and test industry, after penetrates expert interview and the questionnaire survey, inducted industry thought which the more important manufacturing execution for system knowledge management theme; Which knowledge management activity frequently uses to solve manufacturing execution system problem and which knowledge management functionalities will be produced as well. Finally found out the relationship between manufacturing system and knowledge management, through the union of knowledge management and the manufacturing execution system assists enterprise to work the solution, which the error prevention, the solution while error occurs, and preventing the error happens again. Guarantees the quality, delivery date, enhances the customer satisfaction. Key words: Manufacturing Execution System, Knowledge Management Activities, Knowledge Management Functionalities.

Styles APA, Harvard, Vancouver, ISO, etc.

47

Fang, Chiow Chiueh, et 方秀雀. « The Study of Improvement Selection Methods of the Republic of China Civic Service ── The Case of Oral Test ». Thesis, 1996. http://ndltd.ncl.edu.tw/handle/43569032982593661763.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

48

Warman, Leanna Dawn. « Identifying priority conservation areas using systematic reserve selection and GIS at a fine spatial scale : a test case using threatened vertebrate species in the Okanagan, British Columbia ». Thesis, 2002. http://hdl.handle.net/2429/12317.

Texte intégral

Résumé :

Biologists and wildlife managers recognise the need for systematic reserve selection techniques to conserve habitat for species. Geographic information systems (GIS) provide a tool that helps identify conservation areas using geographically referenced data. Mapping continuous geographical phenomena with discreet boundaries affects the spatial organisation of data. However, most published studies of systematic reserve selection techniques have been completed at only one level of data organisation and usually for large regions at coarse scales. In this thesis, I examined the effects of data organisation on reserve selection in the South Okanagan, a small region in British Columbia. I used the software program "C-Plan" with ArcView GIS to identify the minimum amount of area required to achieve explicit conservation targets that maintain species within the region. I evaluated the reserve selection technique using terrestrial ecosystem mapping (TEM) and species habitat models that predict the suitability of T EM polygons for each of twenty-nine threatened vertebrate species. C-Plan selected 37.2% of the region to represent habitat that maintains current population sizes of these threatened vertebrate species. Although habitat area targets were achieved, these priority sites were small and scattered throughout the region and were therefore not practical for implementation or viable for many species. I examined the effects of data organisation on priority site selection by altering three algorithm parameters: (1) size and shape of the unit used to map data and select sites, (2) type of species included in selections, and (3) quantity of the conservation target for each species. The spatial overlap of priority sets of sites that were identified for different values of each parameter was low. Therefore, the spatial distribution of priority conservation sites depends on values for these parameters. Data organisation also influenced the evaluation of existing protected areas in the region for maintaining the threatened vertebrate species. Both selection unit size and assignment of protection status to selection units, based on area of overlap with actual protected areas, resulted in different evaluations of reserve performance. I demonstrate that systematic reserve selection cannot be performed with data at only one spatial organisation unless the consequences are recognised.

Styles APA, Harvard, Vancouver, ISO, etc.

49

Davis, Ryan Jonathan. « The validation of a psychological assessment battery for the selection of customer service agents in a South African commercial airline company ». Diss., 2013. http://hdl.handle.net/10500/11969.

Texte intégral

Résumé :

The purpose of the research was to determine whether measures of ability, personality and behaviour would significantly predict job performance of customer service agents in a South African commercial airline company. The Verbal Interpretation Test (VCC1), Numerical Reasoning Test (NP6.1), Basic Checking Test (CP7.1C), Occupational Personality Questionnaire (OPQ32) and a competency based interview were completed by job applicants. Customer Contact Competency (CCC) scores and a Person Job Match (PJM) score were derived from the OPQ32 and ability measures to ensure job relevance during selection assessment. Job performance statistics in the form of training scores and supervisor ratings (from performance appraisals and criterion questionnaires) were obtained for the sample as criterion data. Correlations revealed statistically significant small to moderate correlations between the predictors and the criterion data
Industrial & Organisational Psychology
M.Com (Industrial & Organisational Psychology)

Styles APA, Harvard, Vancouver, ISO, etc.

Thèses sur le sujet « Test case selection and execution »

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres