2018 IEEE/ACM 13th International Workshop on Automation of Software Test (AST)最新文献

Test Suite Reduction for Self-Organizing Systems: A Mutation-Based Approach 自组织系统的测试套件缩减:基于突变的方法

2018 IEEE/ACM 13th International Workshop on Automation of Software Test (AST) Pub Date : 2018-05-28 DOI: 10.1145/3194733.3194739

André Reichstaller, Benedikt Eberhardinger, Hella Ponsar, Alexander Knapp, W. Reif

{"title":"Test Suite Reduction for Self-Organizing Systems: A Mutation-Based Approach","authors":"André Reichstaller, Benedikt Eberhardinger, Hella Ponsar, Alexander Knapp, W. Reif","doi":"10.1145/3194733.3194739","DOIUrl":"https://doi.org/10.1145/3194733.3194739","url":null,"abstract":"We study regression testing and test suite reduction for self-organizing (SO) systems. The complex environments of SO systems typically require large test suites. The physical distribution of their components and their history-dependent behavior, however, make test execution very expensive. Consequently, an efficient test suite reduction mechanism is needed. The fundamental characteristic of SO systems is their ability to reconfigure themselves. We thus in- vestigate a mutation-based approach concentrating on reconfigura- tions, more specifically the communication between the distributed components in reconfigurations. Due to distribution, we argue for an explicit consideration of higher-order mutants and find a short- cut that makes the number of test cases to execute before reduction feasible. For the reduction task, we evaluate the applicability of two existing clustering techniques, Affinity Propagation and Dissimilar- ity-based Sparse Subset Selection. It turns out that these techniques are able to drastically reduce the original test suite while retaining a good mutation score. We discuss the approach by means of a test suite for a self-organizing production cell as a running example.","PeriodicalId":423703,"journal":{"name":"2018 IEEE/ACM 13th International Workshop on Automation of Software Test (AST)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125493484","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}

引用次数: 7

Using Controlled Numbers of Real Faults and Mutants to Empirically Evaluate Coverage-Based Test Case Prioritization 使用控制数量的真实故障和突变来经验性地评估基于覆盖率的测试用例优先级

2018 IEEE/ACM 13th International Workshop on Automation of Software Test (AST) Pub Date : 2018-05-28 DOI: 10.1145/3194733.3194735

David Paterson, G. M. Kapfhammer, G. Fraser, Phil McMinn

{"title":"Using Controlled Numbers of Real Faults and Mutants to Empirically Evaluate Coverage-Based Test Case Prioritization","authors":"David Paterson, G. M. Kapfhammer, G. Fraser, Phil McMinn","doi":"10.1145/3194733.3194735","DOIUrl":"https://doi.org/10.1145/3194733.3194735","url":null,"abstract":"Used to establish confidence in the correctness of evolving software, regression testing is an important, yet costly, task. Test case prioritization enables the rapid detection of faults during regression testing by reordering the test suite so that effective tests are run as early as is possible. However, a distinct lack of information about the regression faults found in complex real-world software forced prior experimental studies of these methods to use artificial faults called mutants. Using the Defects4J database of real faults, this paper presents the results of experiments evaluating the effectiveness of four representative test prioritization techniques. Since this paper’s results show that prioritization is susceptible to high amounts of variance when only one fault is present, our experiments also control the number of real faults and mutants in the program subject to regression testing. Our overall findings are that, in comparison to mutants, real faults are harder for reordered test suites to quickly detect, suggesting that mutants are not a surrogate for real faults.","PeriodicalId":423703,"journal":{"name":"2018 IEEE/ACM 13th International Workshop on Automation of Software Test (AST)","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116544400","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}

引用次数: 10

Revisiting AI and Testing Methods to Infer FSM Models of Black-Box Systems 黑箱系统FSM模型的人工智能与测试方法研究

2018 IEEE/ACM 13th International Workshop on Automation of Software Test (AST) Pub Date : 2018-05-28 DOI: 10.1145/3194733.3194736

Roland Groz, A. Simão, N. Brémond, Catherine Oriat

引用次数: 11

Software Testing as a Problem of Machine Learning: Towards a Foundation on Computational Learning Theory 软件测试作为机器学习的一个问题:迈向计算学习理论的基础

2018 IEEE/ACM 13th International Workshop on Automation of Software Test (AST) Pub Date : 2018-05-28 DOI: 10.1145/3194733.3194745

Hong Zhu

引用次数: 3

Improving Continuous Integration with Similarity-Based Test Case Selection 使用基于相似度的测试用例选择改进持续集成

2018 IEEE/ACM 13th International Workshop on Automation of Software Test (AST) Pub Date : 2018-05-28 DOI: 10.1145/3194733.3194744

F. D. O. Neto, Azeem Ahmad, O. Leifler, K. Sandahl, Eduard Paul Enoiu

引用次数: 13

Planning-Based Security Testing of Web Applications 基于计划的Web应用程序安全测试

2018 IEEE/ACM 13th International Workshop on Automation of Software Test (AST) Pub Date : 2018-05-28 DOI: 10.1145/3194733.3194738

Josip Bozic, F. Wotawa

引用次数: 8

Memory Corruption Detecting Method Using Static Variables and Dynamic Memory Usage 基于静态变量和动态内存使用的内存损坏检测方法

2018 IEEE/ACM 13th International Workshop on Automation of Software Test (AST) Pub Date : 2018-05-28 DOI: 10.1145/3194733.3194741

Jihyun Park, Chang-Seo Park, Byoungju Choi, Gihun Chang

引用次数: 1

On the Effectiveness of Random Testing for Android: Or How I Learned to Stop Worrying and Love the Monkey 关于Android随机测试的有效性:或者我如何学会停止担忧并爱上猴子

2018 IEEE/ACM 13th International Workshop on Automation of Software Test (AST) Pub Date : 2018-05-28 DOI: 10.1145/3194733.3194742

Priyam Patel, Gokul Srinivasan, Sydur Rahaman, Iulian Neamtiu

{"title":"On the Effectiveness of Random Testing for Android: Or How I Learned to Stop Worrying and Love the Monkey","authors":"Priyam Patel, Gokul Srinivasan, Sydur Rahaman, Iulian Neamtiu","doi":"10.1145/3194733.3194742","DOIUrl":"https://doi.org/10.1145/3194733.3194742","url":null,"abstract":"Random testing of Android apps is attractive due to ease-of-use and scalability, but its effectiveness could be questioned. Prior studies have shown that Monkey – a simple approach and tool for random testing of Android apps – is surprisingly effective, \"beating\" much more sophisticated tools by achieving higher coverage. We study how Monkey's parameters affect code coverage (at class, method, block, and line levels) and set out to answer several research questions centered around improving the effectiveness of Monkey-based random testing in Android, and how it compares with manual exploration. First, we show that random stress testing via Monkey is extremely efficient (85 seconds on average) and effective at crashing apps, including 15 widely-used apps that have millions (or even billions) of installs. Second, we vary Monkey's event distribution to change app behavior and measured the resulting coverage. We found that, except for isolated cases, altering Monkey's default event distribution is unlikely to lead to higher coverage. Third, we manually explore 62 apps and compare the resulting coverages; we found that coverage achieved via manual exploration is just 2-3% higher than that achieved via Monkey exploration. Finally, our analysis shows that coarse-grained coverage is highly indicative of fine-grained coverage, hence coarse-grained coverage (which imposes low collection overhead) hits a performance vs accuracy sweet spot.","PeriodicalId":423703,"journal":{"name":"2018 IEEE/ACM 13th International Workshop on Automation of Software Test (AST)","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124222102","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}

引用次数: 38

Testing Service Oriented Architectures Using Stateful Service Virtualization via Machine Learning 通过机器学习使用有状态服务虚拟化测试面向服务的架构

2018 IEEE/ACM 13th International Workshop on Automation of Software Test (AST) Pub Date : 2018-05-28 DOI: 10.1145/3194733.3194737

Hasan Ferit Eniser, A. Sen

引用次数: 11

An Automated Model-Based Test Oracle for Access Control Systems 一种用于访问控制系统的基于模型的自动化测试Oracle

2018 IEEE/ACM 13th International Workshop on Automation of Software Test (AST) Pub Date : 2018-05-28 DOI: 10.1145/3194733.3194743

A. Bertolino, Said Daoudagh, F. Lonetti, E. Marchetti

引用次数: 10