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

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

来源：评论

学校读者我要写书评

暂无评论

constraint-based testing of An Industrial Multi-Robot Navigation System 1

Constraint-Based Testing of An Industrial Multi-Robot Naviga...

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Mining constant information for readable test data generation

引用

INTERNATIONAL JOURNAL OF EMBEDDED SYSTEMS 2021年第1期14卷 9-18页

作者： Zhang, Mingzhe Gong, Yunzhan Wang, Yawen Jin, Dahai Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China

Automated test data generation tools produce test data that can achieve high coverage faster than test data generated manually by a tester. However, the test data generated by automated tools has been shown to not help developers find more bugs. The main reason is that it is difficult for human testers to understand and evaluate the test data. In this paper, an approach is introduced to automatically generate readable test data, which has been implemented in a tool called CTS. CTS can mine constant information from projects under testing and obtain heuristic information by aggregating and rating related constants. CTS adds heuristic information to the automatic test data generation process to generate test data that is quick and easy for a human to comprehend and check. Empirical experiments show that the proposed approach can improve the efficiency of test data generation and generate test data that is more convenient for a human oracle.

关键词： test data generation readable test data constraint-based testing CBT symbolic execution

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Efficient Sampling of SAT Solutions for testing 18

Efficient Sampling of SAT Solutions for Testing

引用

40th ACM/IEEE International Conference on Software Engineering (ICSE)

作者： Dutra, Rafael Laeufer, Kevin Bachrach, Jonathan Sen, Koushik Univ Calif Berkeley Dept EECS Berkeley CA 94720 USA

ISBN: (纸本)9781450356381

In software and hardware testing, generating multiple inputs which satisfy a given set of constraints is an important problem with applications in fuzz testing and stimulus generation. However, it is a challenge to perform the sampling efficiently, while generating a diverse set of inputs which satisfy the constraints. We developed a new algorithm QUICKSAMPLER which requires a small number of solver calls to produce millions of samples which satisfy the constraints with high probability. We evaluate QUICKSAMPLER on large real-world benchmarks and show that it can produce unique valid solutions orders of magnitude faster than other state-of-the-art sampling tools, with a distribution which is reasonably close to uniform in practice.

关键词： sampling stimulus generation constraint-based testing constrained-random verification

来源：评论

学校读者我要写书评

暂无评论

constraint-based Oracles for Timed Distributed Systems 29th

Constraint-Based Oracles for Timed Distributed Systems

引用

29th IFIP WG 6.1 International Conference on testing Software and Systems (ICTSS)

作者： Benharrat, Nassim Gaston, Christophe Hierons, Robert M. Lapitre, Arnault Le Gall, Pascale CEA LIST Lab Model Driven Engn Embedded Syst PC 174 F-91191 Gif Sur Yvette France Brunel Univ London Uxbridge UB8 3PH Middx England Univ Paris Saclay Cent Supelec Lab MICS F-92295 Chatenay Malabry France

ISBN: (纸本)9783319675497;9783319675480

This paper studies the situation in which the system under test and the system model are distributed and have the same structure;they have corresponding remote components that communicate asynchronously. In testing, a component with interface C-i has its own local tester that interacts with C-i and this local tester observes a local trace consisting of inputs, outputs and durations as perceived by C-i. An observation made in testing is thus a multi-trace: a tuple of (timed) local traces, one for each C-i. The conformance relation for such distributed systems combines a classical unitary conformance relation for localised components and the requirement that the communication policy was satisfied. By expressing the communication policy as a constraint satisfaction problem, we were able to implement the computation of test verdicts by orchestrating localised off-line testing algorithms and the verification of constraints defined by message passing between components. Lastly, we illustrate our approach on a telecommunications system.

关键词： Model-based testing Distributed testing Timed input output transition systems Off-line testing constraint-based testing

来源：评论

学校读者我要写书评

暂无评论

Search-based testing and System testing: A Marriage in Heaven 10

Search-based Testing and System Testing: A Marriage in Heave...

引用

IEEE/ACM 10th International Workshop on Search-based Software testing (SBST)

作者： Zeller, Andreas Saarland Univ Saarland Informat Campus Saarbrucken Germany

ISBN: (纸本)9781538627891

Software test generation can take place at the function level or the system level;and be driven by random, constraint-based, and/or search-based techniques. In this paper, we argue that the best way to generate tests is at the system level, as it avoids false failures due to implicit preconditions;and that for testing at the system level, search-based techniques are best suited as they avoid the combinatorial explosion of conditions due to long paths.

关键词： software test generation system testing random testing constraint-based testing search-based testing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：