{"title":"Generation of executable test cases based on behavioral UML system models","authors":"C. Schwarzl, B. Peischl","doi":"10.1145/1808266.1808271","DOIUrl":"https://doi.org/10.1145/1808266.1808271","url":null,"abstract":"The further automation of the test development process beyond the automatic execution of tests is an increasing challenge, because the development of new functionalities has a higher pace than the test development. The use of model based techniques combined with test generation methods enable a fast test definition while the test oracle is calculated automatically. The presented approach was implemented in a research prototype, which was used to generate test cases out of an UML state chart model describing the behavior of the system under test. The resulting test sequences were executed on a hardware in the loop (HiL) and showed its applicability in an industrial setting.","PeriodicalId":443108,"journal":{"name":"International Conference/Workshop on Automation of Software Test","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116828619","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Towards automating the generation of mutation tests","authors":"Mike Papadakis, N. Malevris, Maria Kallia","doi":"10.1145/1808266.1808283","DOIUrl":"https://doi.org/10.1145/1808266.1808283","url":null,"abstract":"Automating software testing activities can increase the quality and drastically decrease the cost of software development. Towards this direction various automated test data generation tools have been developed. The majority of them aim at branch testing, while a quite limited number aim at a higher level of testing thoroughness such as mutation. In this paper an automated framework that makes a joint use of diverse techniques and tools is introduced in the context of automating mutation based test generation. The motivation behind this work is the use of existing techniques and tools such as symbolic execution and evolutionary testing towards automating the test input generation activity according to the weak mutation testing criterion. The proposed framework integrates existing automated tools for branch testing in order to effectively generate mutation test data. To fulfill this suggestion three automated tools are used for illustration purposes and preliminary results are obtained by applying the proposed framework to a set of java program units indicating the applicability and effectiveness of the proposed approach.","PeriodicalId":443108,"journal":{"name":"International Conference/Workshop on Automation of Software Test","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128936311","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Abstract path testing with PathCrawler","authors":"Nicky Williams","doi":"10.1145/1808266.1808272","DOIUrl":"https://doi.org/10.1145/1808266.1808272","url":null,"abstract":"PathCrawler is a tool developed by CEA List for the automatic generation of test inputs to ensure the coverage of all feasible execution paths of a C function. Due to its concolic approach and depth-first exhaustive search strategy implemented in Prolog, PathCrawler is particularly efficient in the generation of tests to cover the fully expanded tree of feasible paths. However, for many tested functions this coverage criterion demands too many tests and a weaker criterion must be used. In order to efficiently generate tests for a new criterion whilst still using a concolic approach, we must modify the search strategy. To facilitate the definition and comparison of different coverage criteria, we propose a new type of tree, trees of abstract paths, and define the different types of abstract node in these trees. We demonstrate how several criteria can be conveniently defined in terms of coverage of these new trees. Moreover, efficient generation of tests to satisfy these criteria using the concolic approach can be designed as different strategies to explore these trees.","PeriodicalId":443108,"journal":{"name":"International Conference/Workshop on Automation of Software Test","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117089689","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Structural coverage of feasible code","authors":"M. Baluda, Pietro Braione, G. Denaro, M. Pezzè","doi":"10.1145/1808266.1808275","DOIUrl":"https://doi.org/10.1145/1808266.1808275","url":null,"abstract":"Infeasible execution paths reduce the precision of structural testing coverage and limit the industrial applicability of structural testing criteria. In this paper, we propose a technique that combines static and dynamic analysis approaches to identify infeasible program elements that can be eliminated from the computation of structural coverage to obtain accurate coverage data. The main novelty of the approach stems from its ability to identify a relevant number of infeasible elements, that is, elements that belong statically to the code, but cannot be executed under any input condition. The technique can also generate new test cases that execute uncovered elements, thus increasing the structural coverage of the program. The experimental results obtained on a prototype implementation for computing accurate branch coverage and reported in this paper indicate that the technique can effectively improve structural coverage measurements and can thus increase the industrial applicability of complex structural coverage criteria.","PeriodicalId":443108,"journal":{"name":"International Conference/Workshop on Automation of Software Test","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121552531","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Model-based testing of multiple GUI variants using the GUI test generator","authors":"Duc-Hoai Nguyen, P. Strooper, Jörn Guy Süß","doi":"10.1145/1808266.1808270","DOIUrl":"https://doi.org/10.1145/1808266.1808270","url":null,"abstract":"Many modern application development frameworks separate presentation logic and business logic into layers. However, current model-based GUI testing tools do not model and test presentation logic and business logic separately. This paper proposes to separate business logic from the GUI behaviour model. The business logic is modelled using traditional modelbased testing tools like Spec Explorer while the presentation logic is recorded by a capture/replay tool. The two parts are connected via a mapping model. This paper proposes a new approach to test multiple GUI variants of an application in a reusable manner and introduces the GUI Test Generator (GTG). GTG is a tool which allows testers to define a mapping from business logic to presentation logic. Based on the mapping, GTG converts business logic test cases into presentation logic test cases. GTG is particularly useful for testing applications with a single business logic core and multiple variants of the user interface. This paper introduces the architecture of GTG and presents a case study for testing two different front-ends of an email client.","PeriodicalId":443108,"journal":{"name":"International Conference/Workshop on Automation of Software Test","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132473506","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Samuel Rivas, Miguel Angel Francisco, V. M. Gulías
{"title":"Property driven development in Erlang, by example","authors":"Samuel Rivas, Miguel Angel Francisco, V. M. Gulías","doi":"10.1145/1808266.1808277","DOIUrl":"https://doi.org/10.1145/1808266.1808277","url":null,"abstract":"As an example of the combination of Test Driven Development and Property Based Testing, this paper presents the implementation of a template library from scratch using the functional language Erlang for development and the tool QuickCheck for testing.","PeriodicalId":443108,"journal":{"name":"International Conference/Workshop on Automation of Software Test","volume":"273 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132928582","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
M. Jovic, Andrea Adamoli, Dmitrijs Zaparanuks, Matthias Hauswirth
{"title":"Automating performance testing of interactive Java applications","authors":"M. Jovic, Andrea Adamoli, Dmitrijs Zaparanuks, Matthias Hauswirth","doi":"10.1145/1808266.1808268","DOIUrl":"https://doi.org/10.1145/1808266.1808268","url":null,"abstract":"Interactive applications with graphical user interfaces are prevalent in today's environment: Everybody with access to any kind of computer constantly uses them. A significant body of prior work has devised approaches for automating the functional testing of such applications. However, no such work exists for automatically testing their performance. Performance testing imposes additional requirements upon GUI test automation tools: the tools have to be able to replay complex interactive sessions, and they have to avoid perturbing the application's performance. We study the feasibility of using five Java GUI capture & replay tools for GUI performance test automation. Besides confirming the severity of the previously known GUI element identification problem, we also identify a related problem, the temporal synchronization problem, which is of increasing importance for GUI applications that use timer-driven activity. We find that most of the tools we study have severe limitations when used for recording and replaying realistic sessions of real-world Java applications, and that all of them suffer from the temporal synchronization problem. However, we find that the most reliable tool, Pounder, causes only limited perturbation, and thus can be used to automate performance testing. Besides the significance of our findings to GUI performance testing, the results are also relevant to capture & replay-based functional GUI test automation approaches.","PeriodicalId":443108,"journal":{"name":"International Conference/Workshop on Automation of Software Test","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117281323","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A generic formal framework for protocol interoperability test and test cases minimization","authors":"N. Zhong, Zun-wen He, Jing-ming Kuang","doi":"10.1145/1370042.1370055","DOIUrl":"https://doi.org/10.1145/1370042.1370055","url":null,"abstract":"A generic formal framework for protocol interoperability test is proposed, which consider the common situation of protocol interoperability test by introducing the multi-stimuli principle in the multi-port FSM. A novel interoperability test sequences minimization scheme based on genetic algorithm (GA) is proposed to avoid the state space explosion problem, which easily occur in multi-stimuli systems during the interoperability test. Interoperability test sequences always contain two parts: interoperability part and local part. Conventional algorithms only remove redundancy from conformance test sequences and do not consider the redundant path relevant for interoperability part. During our work, the minimal-complete-coverage criterion and GA are applied to remove redundancy in both local transitions and interoperability transitions. Experiment results show that compare to conventional algorithm, our algorithm can avoid the state space explosion problem effectively and more practical for it can reduce the length of the test sequences and maintain the same transition coverage.","PeriodicalId":443108,"journal":{"name":"International Conference/Workshop on Automation of Software Test","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130141249","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An EFSM-based test generation for validation of SDL specifications","authors":"W. E. Wong, Andy Restrepo, Yu Qi, Byoungju Choi","doi":"10.1145/1370042.1370049","DOIUrl":"https://doi.org/10.1145/1370042.1370049","url":null,"abstract":"Existing techniques for testing an SDL specification mainly allow for either black box simulation or conformance testing to verify that the behavior of an implementation matches its corresponding model. However, this relies on the potentially hazardous assumption that the model is completely correct. We propose a test generation framework that can accomplish conformance verification as well as coverage criteria-driven white box testing of the specification itself. This approach builds on earlier work which established how to translate SDL processes into standard EFSMs and identify \"hot spots\" - nodes or edges in the EFSM which should be prioritized during testing to effectively increase coverage. Our technique generates test sequences intended to cover selected hot spots; we address the possible infeasibility of such a test sequence by allowing for its rejection decided by a constraint solver and re-generation of an alternate test sequence to the hot spot. In this paper, we present our EFSM translation and test generation tool and provide a case study demonstrating the effectiveness of our coverage-based test sequence selection.","PeriodicalId":443108,"journal":{"name":"International Conference/Workshop on Automation of Software Test","volume":"357 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121629319","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
F. Bouquet, Christophe Grandpierre, B. Legeard, F. Peureux
{"title":"A test generation solution to automate software testing","authors":"F. Bouquet, Christophe Grandpierre, B. Legeard, F. Peureux","doi":"10.1145/1370042.1370052","DOIUrl":"https://doi.org/10.1145/1370042.1370052","url":null,"abstract":"This paper describes the LEIRIOS Smart Testing™ approach to the functional validation of a subpart of the StarUML case study. This model-based testing process for test automation is shown from start to end: from functional requirements to the publication of generated tests in a test repository and automatic execution of scripts with a test execution robot. This is a short position paper illustrating how LEIRIOS Smart Testing\" can help to answer to the question: how to automate the testing of UML/MDA platform StarUML.","PeriodicalId":443108,"journal":{"name":"International Conference/Workshop on Automation of Software Test","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115294981","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}