Dissertations / Theses on the topic 'Test case selection and execution'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 49 dissertations / theses for your research on the topic 'Test case selection and execution.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Bogren, Patrik, and 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.
Full textYing, PuLe, and 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.
Full textZhan, Zhiyan. "Automated test case selection." Thesis, University of Ottawa (Canada), 1995. http://hdl.handle.net/10393/10209.
Full textYadavalli, 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.
Full textLindholm, 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.
Full textHöstklint, Niklas, and 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.
Full textTestning 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.
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.
Full textBester, 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.
Full textENGLISH 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.
Drincic, Samir, and 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.
Full textMorrison, George Campbell. "Automated coverage calculation and test case generation." Thesis, Stellenbosch : Stellenbosch University, 2012. http://hdl.handle.net/10019.1/20041.
Full textENGLISH 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.
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.
Full textKaiser, 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.
Full textPå 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.
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.
Full textGamini, 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.
Full textAmeerjan, 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.
Full textKunze, 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.
Full textMADHUKAR, 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.
Full textPESSOA, 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.
Full textThis 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.
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.
Full textMade 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 modifications can be performed in a specification model in order to satisfy new requirements. Perform regression testing on modified 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 specification models were modified. Our technique, named Similarity Approach for Regression Testing (SART), selects subset of test cases traversing modified regions of a software system’s specification model. That strategy relies on similarity-based test case selection where similarities between test cases from different software versions are analysed to identify modified 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 modification and revealing defects linked to model modifications. 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 modifications can be performed in a specification model in order to satisfy new requirements. Perform regression testing on modified 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 specification models were modified. Our technique, named Similarity Approach for Regression Testing (SART), selects subset of test cases traversing modified regions of a software system’s specification model. That strategy relies on similarity-based test case selection where similarities between test cases from different software versions are analysed to identify modified 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 modification and revealing defects linked to model modifications. Both SART and our experiment are executable through the LTS-BT tool, enabling researchers to use our selections trategy andr eproduce our experiment.
Kuchimanchi, Sriram. "Towards a regression test selection technique for message-based software integration." ScholarWorks@UNO, 2004. http://louisdl.louislibraries.org/u?/NOD,164.
Full textTitle 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.
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/.
Full textLachmann, Remo Verfasser], and 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.
Full textWang, Huai, and 王怀. "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.
Full textpublished_or_final_version
Computer Science
Doctoral
Doctor of Philosophy
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.
Full textDenna 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.
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.
Full textI 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
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.
Full textIn 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.
Bentakouk, Lina. "Test symbolique de services web composite." Phd thesis, Université Paris Sud - Paris XI, 2011. http://tel.archives-ouvertes.fr/tel-00675918.
Full textRafi, Dudekula Mohammad, and 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.
Full textMobile no: +46723069909
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.
Full textNarciso, 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/.
Full textImage 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.
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.
Full textApproved 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 (CGACGCop) 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 CGACGCop 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 AGCCGCop no uso da CG. Tais resultados evidenciam a abordagem proposta com uso promissor no contexto do Teste de Mutação.
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.
Full textApproved 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.
CARNEVALI, LAURA. "Formal methods in the development life cycle of real-time software." Doctoral thesis, 2010. http://hdl.handle.net/2158/521924.
Full textAfonso, 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.
Full textÀ 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.
Siddiquee, Shoukat Hayat. "Timed test case execution for distributed real-time systems." Thesis, 2005. http://spectrum.library.concordia.ca/8724/1/MR14282.pdf.
Full textLi, Wen-Chi, and 李文棋. "Tool Support for Test Case Selection." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/y6ehfv.
Full text國立臺北科技大學
資訊工程系所
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.
Lee, Jen-Gaw, and 李正國. "A Study of Optimal Test Case Selection Problem." Thesis, 2000. http://ndltd.ncl.edu.tw/handle/92995149359331324785.
Full text國立交通大學
資訊工程系
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.
Yu, Tung-Hsung, and 余東欣. "Test Case Ordering and Selection for Blackbox Testing." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/59826718634929901147.
Full text中原大學
工業與系統工程研究所
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.
Lin, Jhih-Yu, and 林芝妤. "Test Case Selection and Scheduling Based on Requirement Coverage." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/dtp6e9.
Full text中原大學
工業工程研究所
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.
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.
Full textSung, Jung-Chun, and 宋榮浚. "Test Case selection and distribution for multi tester to minimize makespan." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/49428884775589335462.
Full text中原大學
工業與系統工程研究所
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.
Hung, Chih-Chung, and 洪志忠. "A Debugging Tool based on Debugging History Management and Test Case Selection." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/4w7q8k.
Full text國立臺北科技大學
資訊工程系研究所
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.
tsai, Martin, and 蔡佳憲. "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.
Full text國立臺灣科技大學
工業管理系
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.
Lin, Tzu-Hsiang, and 林子翔. "Application of Genetic Algorithm on Test Case Selection against State Coverage of Kernel Code." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/59183839783775356339.
Full text臺灣大學
電子工程學研究所
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.
Wei, Jiawei. "Secondary Analysis of Case-Control Studies in Genomic Contexts." Thesis, 2010. http://hdl.handle.net/1969.1/ETD-TAMU-2010-08-8269.
Full textLee, Chih-Chieh, and 李之傑. "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.
Full text中原大學
資訊管理研究所
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.
Fang, Chiow Chiueh, and 方秀雀. "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.
Full textWarman, 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.
Full textDavis, 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.
Full textIndustrial & Organisational Psychology
M.Com (Industrial & Organisational Psychology)