2015 IEEE 8th International Conference on Software Testing, Verification and Validation (ICST)最新文献_第6页

Using Fuzzy Logic and Symbolic Execution to Prioritize UML-RT Test Cases 使用模糊逻辑和符号执行来确定UML-RT测试用例的优先级

2015 IEEE 8th International Conference on Software Testing, Verification and Validation (ICST) Pub Date : 2015-04-13 DOI: 10.1109/ICST.2015.7102610

E. J. Rapos, J. Dingel

{"title":"Using Fuzzy Logic and Symbolic Execution to Prioritize UML-RT Test Cases","authors":"E. J. Rapos, J. Dingel","doi":"10.1109/ICST.2015.7102610","DOIUrl":"https://doi.org/10.1109/ICST.2015.7102610","url":null,"abstract":"The relative ease of test case generation associated with model-based testing can lead to an increased number of test cases being identified for any given system; this is problematic as it is becoming near impossible to run (or even generate) all of the possible tests in available time frames. Test case prioritization is a method of ranking the tests in order of importance, or priority based on criteria specific to a domain or implementation, and selecting some subset of tests to generate and run. Some approaches require the generation of all tests, and simply prioritize the ones to be run, however we propose an approach that would prevent unnecessary generation of tests through the use of symbolic execution trees to determine which tests provide the most benefit to coverage of execution. Our approach makes use of fuzzy logic, specifically fuzzy control systems, to prioritize test cases generated from these execution; the prioritization is based on natural language rules about testing priority. Within this paper we present our motivation, some background research, our methodology and implementation, results, and conclusions.","PeriodicalId":401414,"journal":{"name":"2015 IEEE 8th International Conference on Software Testing, Verification and Validation (ICST)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131898645","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}

引用次数: 9

Achievements, Open Problems and Challenges for Search Based Software Testing 基于搜索的软件测试的成就、问题和挑战

2015 IEEE 8th International Conference on Software Testing, Verification and Validation (ICST) Pub Date : 2015-04-13 DOI: 10.1109/ICST.2015.7102580

M. Harman, Yue Jia, Yuanyuan Zhang

引用次数: 195

Optimization of Combinatorial Testing by Incremental SAT Solving 基于增量SAT求解的组合测试优化

2015 IEEE 8th International Conference on Software Testing, Verification and Validation (ICST) Pub Date : 2015-04-13 DOI: 10.1109/ICST.2015.7102599

A. Yamada, Takashi Kitamura, Cyrille Artho, Eun-Hye Choi, Y. Oiwa, Armin Biere

引用次数: 52

Evaluating Symbolic Execution-Based Test Tools 评估基于符号执行的测试工具

2015 IEEE 8th International Conference on Software Testing, Verification and Validation (ICST) Pub Date : 2015-04-13 DOI: 10.1109/ICST.2015.7102587

Lajos Cseppento, Zoltán Micskei

引用次数: 22

On the Industrial Applicability of TextTest: An Empirical Case Study 论文本测试的工业适用性:一个实证案例研究

2015 IEEE 8th International Conference on Software Testing, Verification and Validation (ICST) Pub Date : 2015-04-13 DOI: 10.1109/ICST.2015.7102598

Emil Alégroth, Geoff Bache, E. Bache

{"title":"On the Industrial Applicability of TextTest: An Empirical Case Study","authors":"Emil Alégroth, Geoff Bache, E. Bache","doi":"10.1109/ICST.2015.7102598","DOIUrl":"https://doi.org/10.1109/ICST.2015.7102598","url":null,"abstract":"Software systems are becoming more complex, not least in their Graphical User Interfaces (GUIs), which presents challenges for existing testing practices. Pressure to reduce time to market leaves less time for manual testing and increases the importance of test automation. Previous research has identified several generations of automated GUI-based test approaches with different cost-benefit tradeoffs. Whilst test automation provides fast quality feedback it can be associated with high costs and inability to identify defects not explicitly anticipated by the test designer. TextTest is a capture-replay tool for GUI-based testing with a novel approach that overcomes several of the challenges experienced with previous approaches. Firstly the tool supports Approval Testing, an approach where ASCII-art representations of the GUI's visual state are used to verify correct application behavior at the system level. Secondly it records and replays test scripts in a user defined domain specific language (DSL) that is readable by all stakeholders. In this paper we present a three phase industrial case study that aims to identify TextTest's applicability in industrial practice. The paper reports that the tool is associated with (1) low script development costs due to recording functionality, (2) low maintenance costs, on average 7 minutes per test case, (3) better defect finding ability than manual system testing, (4) high test case execution performance (In this case 500 test cases in 20 minutes), (5) high script readability due to DSL defined scripts, and (6) test suites that are robust to change (In this case 93 percent per iteration). However, the tool requires a higher degree of technical skill for customization work, test maintainers need skills in designing regular expressions and the tool's applicability is currently restricted to Java and Python based applications.","PeriodicalId":401414,"journal":{"name":"2015 IEEE 8th International Conference on Software Testing, Verification and Validation (ICST)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132518023","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}

引用次数: 2

QuickChecking Static Analysis Properties 快速检查静态分析属性

2015 IEEE 8th International Conference on Software Testing, Verification and Validation (ICST) Pub Date : 2015-04-13 DOI: 10.1002/stvr.1640

Jan Midtgaard, Anders Møller

引用次数: 22

Generating Tests for Detecting Faults in Feature Models 生成用于检测特征模型中的故障的测试

2015 IEEE 8th International Conference on Software Testing, Verification and Validation (ICST) Pub Date : 2015-04-01 DOI: 10.1109/ICST.2015.7102591

Paolo Arcaini, A. Gargantini, Paolo Vavassori

引用次数: 38

Postconditioned Symbolic Execution 后置条件符号执行

2015 IEEE 8th International Conference on Software Testing, Verification and Validation (ICST) Pub Date : 2015-04-01 DOI: 10.1109/ICST.2015.7102601

Qiuping Yi, Z. Yang, Shengjian Guo, Chao Wang, Jian Liu, Chen Zhao

{"title":"Postconditioned Symbolic Execution","authors":"Qiuping Yi, Z. Yang, Shengjian Guo, Chao Wang, Jian Liu, Chen Zhao","doi":"10.1109/ICST.2015.7102601","DOIUrl":"https://doi.org/10.1109/ICST.2015.7102601","url":null,"abstract":"Symbolic execution is emerging as a powerful technique for generating test inputs systematically to achieve exhaustive path coverage of a bounded depth. However, its practical use is often limited by path explosion because the number of paths of a program can be exponential in the number of branch conditions encountered during the execution. To mitigate the path explosion problem, we propose a new redundancy removal method called postconditioned symbolic execution. At each branching location, in addition to determine whether a particular branch is feasible as in traditional symbolic execution, our approach checks whether the branch is subsumed by previous explorations. This is enabled by summarizing previously explored paths by weakest precondition computations. Postconditioned symbolic execution can identify path suffixes shared by multiple runs and eliminate them during test generation when they are redundant. Pruning away such redundant paths can lead to a potentially exponential reduction in the number of explored paths. We have implemented our method in the symbolic execution engine KLEE and conducted experiments on a large set programs from the GNU Coreutils suite. Our results confirm that redundancy due to common path suffix is both abundant and widespread in real- world applications.","PeriodicalId":401414,"journal":{"name":"2015 IEEE 8th International Conference on Software Testing, Verification and Validation (ICST)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115706021","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}

引用次数: 25

Co-Evolution of Model-Based Tests for Industrial Automotive Software 基于模型的工业汽车软件测试的协同演化

2015 IEEE 8th International Conference on Software Testing, Verification and Validation (ICST) Pub Date : 2014-09-29 DOI: 10.1109/ICST.2015.7102613

E. J. Rapos

引用次数: 7