检索结果-内蒙古大学图书馆

1st IEEE International Conference on Artificial Intelligence testing (IEEE AITest)

作者： Muehlbacher, Clemens Steinbauer, Gerald Reip, Michael Gspandl, Stephan Graz Univ Technol Inst Software Technol Graz Austria Incubed IT Hart Bei Graz Austria

ISBN: (纸本)9781728104928

Intelligent multi-robot systems get more and more deployed in industrial settings to solve complex and repetitive tasks. Due to safety and economic reasons they need to operate dependably. To ensure a high degree of dependability, testing the deployed system has to be done in a rigorous way. Advanced multi-robot systems show a rich set of complex behaviors. Thus, these systems are difficult to test manually. Moreover, the space of potential environments and tasks for such systems is enormous. Therefore, methods that are able to explore this space in a structured way are needed. One way to address these issues is through model-based testing. In this paper we present an approach for testing the navigation system of a fleet of industrial transport robots. We show how all potential environments and navigation behaviors as well as requirements and restrictions can be represented in a formal constraint-based model. Moreover, we present the concept of coverage criteria in order to handle the potentially infinite space of test cases. Finally, we show how test cases can be derived from this model in an efficient way. In order to show the feasibility of the proposed approach we present an empirical evaluation of a prototype implementation using a real industrial use case.

关键词： constraint-based testing constraint-satisfaction multi-agent systems navigation

来源：评论

学校读者我要写书评

暂无评论

Modelling dynamic memory management in constraint-based testing

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2009年第11期82卷 1755-1766页

作者： Charreteur, Florence Botella, Bernard Gotlieb, Arnaud Univ Rennes 1 F-35042 Rennes France CEA LIST F-91191 Gif Sur Yvette France INRIA F-35042 Rennes France

constraint-based testing (CBT) is the process of generating test cases against a testing objective by using constraint solving techniques. When programs contain dynamic memory allocation and loops, constraint reasoning becomes challenging as new variables and new constraints should be created during the test data generation process. In this paper, we address this problem by proposing a new constraint model of C programs based on operators that model dynamic memory management. These operators apply powerful deduction rules on abstract states of the memory enhancing the constraint reasoning process. This allows to automatically generate test data respecting complex coverage objectives. We illustrate our approach on a well-known difficult example program that contains dynamic memory allocation/deallocation, structures and loops. We describe our implementation and provide preliminary experimental results on this example that show the highly deductive potential of the approach. (C) 2009 Elsevier Inc. All rights reserved.

关键词： Software testing constraint-based testing Automatic test data generation Dynamic structures

来源：评论

学校读者我要写书评

暂无评论

Integrating Model-based and constraint-based testing Using SpecExplorer

Integrating Model-Based and Constraint-Based Testing Using S...

引用

23rd IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW)

作者： Vishal, Vivek Kovacioglu, Mehmet Kherazi, Rachid Mousavi, Mohammad Reza Philips Healthcare Best Netherlands Eindhoven Univ Technol Eindhoven Netherlands

ISBN: (纸本)9780769549286;9781467350488

We report on our experience with model-based testing using SpecExplorer within the Flat X-Ray Detection (FXD) Department of Philips Healthcare. Our initial experiments showed a practical obstacle in combining traditional functional testing techniques with model-based testing using SpecExplorer. We overcome this obstacle by specifying the constraints on our data domain in a spreadsheet and interfacing SpecExplorer with a constraint solver in order to generate concrete test data for the behavioral specifications. We report on some empirical results obtained from our experiments.

关键词： Model-based testing Decision-Table-based testing constraint-based testing SpecExplorer

来源：评论

学校读者我要写书评

暂无评论

RESTest: Black-Box constraint-based testing of RESTful Web APIs 18th

RESTest: Black-Box Constraint-Based Testing of RESTful Web A...

引用

18th International Conference on Service-Oriented Computing (ICSOC)

作者： Martin-Lopez, Alberto Segura, Sergio Ruiz-Cortes, Antonio Univ Seville Res Inst Comp Engn I3US Smart Comp Syst Res & Engn Lab SCORE Seville Spain

ISBN: (纸本)9783030653101;9783030653095

Automated testing approaches for RESTful web APIs typically follow a black-box strategy, where test cases are derived from the API specification. These techniques show promising results, but they neglect constraints among input parameters (so-called inter-parameter dependencies), as these cannot be formally described in current API specification languages. As a result, black-box tools rely on brute force to generate valid test cases, i.e., those satisfying all the input constraints. This is not only extremely inefficient, but it is also unlikely to work for most real-world services, where inter-parameter dependencies are complex and pervasive. In this paper, we present RESTest, a framework for automated black-box testing of RESTful APIs. Among its key features, RESTest supports the specification and automated analysis of inter-parameter dependencies, enabling the use of constraint solvers for the automated generation of valid test cases. This allows to detect more faults, and faster, through a deeper evaluation of valid and invalid input parameters' combinations and the use of novel test oracles. Evaluation results on 6 commercial APIs show that RESTest can efficiently generate up to 99% more valid test cases than random testing techniques, 60% on average. More importantly, RESTest revealed 2K failures undetected by random testing, uncovering bugs in all the services under test.

关键词： REST Black-box testing constraint-based testing Web services

来源：评论

学校读者我要写书评

暂无评论

Search-based testing using constraint-based mutation

引用

SOFTWARE testing VERIFICATION & RELIABILITY 2014年第6期24卷 472-495页

作者： Malburg, Jan Fraser, Gordon Univ Bremen Grp Reliable Embedded Syst D-28359 Bremen Germany Univ Sheffield Dept Comp Sci Sheffield S10 2TN S Yorkshire England

Many modern automated test generators are based on either metaheuristic search techniques or use constraint solvers. Both approaches have their advantages, but they also have specific drawbacks: Search-based methods may get stuck in local optima and degrade when the search landscape offers no guidance;constraint-based approaches, on the other hand, can only handle certain domains efficiently. This paper describes a method that integrates both techniques and delivers the best of both worlds. On a high-level view, the proposed method uses a genetic algorithm to generate tests, but the twist is that during evolution, a constraint solver is used to ensure that mutated offspring efficiently explores different control flow. Experiments on 20 case study programmes show that on average the combination improves branch coverage by 28% over search-based techniques while reducing the number of tests by 55%, and improves coverage by 13% over constraint-based techniques while reducing the number of tests by 73%. Copyright (C) 2013 John Wiley & Sons, Ltd.

关键词： search-based testing constraint-based testing test data generation

来源：评论

学校读者我要写书评

暂无评论

Mutation analysis and constraint-based criteria: Results from an empirical evaluation in the context of software testing

引用

JOURNAL OF ELECTRONIC testing-THEORY AND APPLICATIONS 2004年第4期20卷 439-445页

作者： Soares, IW Vergilio, SR Univ Estadual Centro Oeste BR-85010990 Guarapuava Brazil UFPR BR-81531970 Curitiba Parana Brazil

Several software testing criteria have been proposed during last years with the goal of aiming the test set generation and revealing many faults as possible. They are considered complementary because can reveal different kind of faults and are based on different principles. For example, structural criteria use the internal structure of the program for deriving test cases;Mutation Analysis is a fault-based criterion;and constraint based Criteria use constraints to be satisfied during the program execution. Because of this, some questions can be posed, such as: "What criterion should be used or be first applied?". Many research works compare criteria with the goal of answering these questions. However, some criteria as Mutation Analysis and constraint based Criteria are theoretically incomparable and only empirical studies can point out the relation between them. This work presents results from an empirical evaluation of Mutation Analysis and All-Constrained-Potential-Uses criterion considering the factors: cost ( number of test cases), efficacy ( number of revealed faults) and strength ( difficulty of satisfying a criterion, given that another one has been satisfied). The obtained results show an empirical relation, which is used to propose a strategy for application of different testing criteria.

关键词： structural testing criteria constraint-based testing mutation testing

来源：评论

学校读者我要写书评

暂无评论

constraint-based Test Case Generation for White-Box Method-Level Unit testing

Constraint-Based Test Case Generation for White-Box Method-L...

引用

International Computer Symposium (ICS)

作者： Chang, Cheng-Hung Lin, Nai-Wei Natl Chung Cheng Univ Dept Comp Sci & Informat Engn Chiayi Taiwan

ISBN: (纸本)9781509034383

This paper introduces a unified constraint-based test case generator for white-box method-level unit testing. The derivation of a suite of test cases can be defined as a constraint satisfaction problem. Each test case consists of a test input and an expected output. The program is automatically transformed into a constraint model called constraint logic graph. The constraint logic graph is a succinct graphical representation of the system of constraints that defines the relationships between the test inputs and actual outputs. The suite of test inputs can be solved from the conjunction of constraints on each complete path of the constraint logic graph by a constraint logic programming language. The specification of a method is defined by the Object constraint Language. This non-executable specification is automatically transformed into an executable specification defined by a constraint logic programming language. This executable specification serves as the test oracle to automatically generate the corresponding expected output for a given test input.

关键词： test case generation white-box testing constraint-based testing constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Mutation analysis and constraint-based criteria: Results from an empirical evaluation in the context of software testing

Mutation analysis and constraint-based criteria: Results fro...

引用

3rd IEEE Latin-American Test Workshop

作者： Soares, IW Vergilio, SR Univ Estadual Centro Oeste BR-85010990 Guarapuava Brazil UFPR BR-81531970 Curitiba Parana Brazil

关键词： structural testing criteria constraint-based testing mutation testing

来源：评论

学校读者我要写书评

暂无评论

Improving Search-based Software testing by constraint-based Genetic Operators

Improving Search-Based Software Testing by Constraint-Based ...

引用

Genetic and Evolutionary Computation Conference (GECCO)

作者： Zhu, Ziming Jiao, Li Univ Chinese Acad Sci State Key Lab Comp Sci Inst Software Chinese Acad Sci Beijing Peoples R China

ISBN: (纸本)9781450361118

Search-based software testing (SBST) has achieved great attention as an effective technique to automate test data generation. The testing problem is converted into a search problem, and a meta-heuristic algorithm is used to search for the test data in SBST. Genetic Algorithm (GA) is the most popular meta-heuristic algorithm used in SBST and the genetic operators are the key parts in GA. Much work has been done to improve SBST while little research has concentrated on the genetic operators. Due to the blindness and randomness of classic genetic operators, SBST is ineffective in many cases. In this paper, we focus on improving the genetic operators by constraint-based software testing. Compared with classic genetic operators, our improved genetic operators are more purposeful. For the selection operator, we use symbolic execution technique to help us select the test cases which have more useful heuristic information. Then, the constraint-based crossover operator recombines the test cases which have more probability to create better offspring individuals. Finally, the constraint-based mutation operator is used to improve the test cases in order to satisfy some specific *** applied our constraint-based genetic operators in several benchmarks and the experiments reveal the promising results of our proposal.

关键词： search-based software testing constraint-based testing genetic operators

来源：评论

学校读者我要写书评

暂无评论

A constraint-based Framework for Test Case Generation in Method-Level Black-Box Unit testing

引用

JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 2016年第2期32卷 365-387页

作者： Chang, Chi-Kuang Lin, Nai-Wei Natl Chung Cheng Univ Dept Comp Sci & Informat Engn Chiayi 621 Taiwan

Automatic test case execution in test-driven development provides an excellent return on investment. However, test cases in test-driven development are usually designed manually. Manual acquisition of test cases is laborious, time-consuming, and error-prone. Model-based testing is a technique to automatically generate test cases from software models. Model-based test-driven development provides an opportunity to automate both test case generation and test case execution. This paper proposes and implements a constraint-based framework for automatic test case generation in method-level black-box unit testing. This framework uniformly solved the test case generation problem using constraint logic graphs and constraint logic programming. This framework effectively performs equivalence class partitioning and test coverage criteria management on constraint logic graphs, and simultaneously generates test input and expected output using constraint logic programming. This unifying constraint-based framework can serve as a nucleus for test case generation in model-based unit testing in the future, including method-level black-box, method-level white-box, and class-level unit testing.

关键词： constraint-based testing black-box testing unit testing method-level unit testing constraint satisfaction problem constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：