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

Business Scenario Driven Reinforcement Learning testing Method

Business Scenario Driven Reinforcement Learning Testing Meth...

software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD-Winter), ACIS International Winter Conference on

作者： Lizhi Cai Jin Wang Shanghai Key Laboratory of Computer Software Testing and Evaluating School of Information Science and Engineering East China University of Science and Technology Shanghai China

Reinforcement learning has been successfully applied in software testing, but the existing testing methods cannot perform effective testing according to the characteristics of applications, and using outdated interactive experience during training, resulting in inefficient testing. In this paper, we propose BSDRtesting. Firstly, the demonstration experience of human users is collected according to the functional scenarios and business logic of each application, and combining reinforcement learning and imitation learning to maximize rewards while imitating user behavior, experience replay aims to sample experiences from the agent's self-exploration and expert demonstrations to improve sampling efficiency. At the same time, according to the input rules, the black-box testing method is used to fully test the input events, and finally an experience filtering mechanism is proposed, and the reward value and TD-Error are used as the basis for priority sampling. The experimental results on 10 open source applications show BSDRtesting has achieved significant improvements in code coverage and branch coverage compared with existing methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

LTL model checking probabilistic Petri net system

引用

International Journal of Advancements in Computing Technology 2012年第1期4卷 172-178页

作者： Liu, Yang Miao, Huaikou School of Computer Engineering and Science Shanghai University Shanghai 200072 China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai 200072 China School of Information Science and Technology Taishan University Taian Shandong 271021 China

Nonfunctional property verification is becoming more and more important to computer system. In recent decades, in order to describe not only the system function but also the system performance, researchers in the area of formal methods try to extend Petri net for modelling computer system, and the verification problem becomes the quantitative verification from the qualitative verification. In this paper, we define the reachability graph and present the solution algorithm to reachability graph;then we put forward an algorithm for linear-time temporal logic model checking probabilistic Petri net system;for demonstrating the effectiveness of this algorithm, we run an example in the modelling an verification tool which we developed.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Modeling and optimizing CPS software testing based on petri nets

引用

International Journal of Performability Engineering 2017年第8期13卷 1183-1194页

作者： Chen, Liqiong Fan, Guisheng Yu, Huiqun Department of Computer Science and Information Engineering Shanghai Institute of Technology Shanghai200235 China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai201112 China Department of Computer Science and Engineering East China University of Science and Technology Shanghai200237 China

software testing is an important means to ensure the quality of software. However, there is a lack of effective modeling and optimization of CPS software testing. In this paper, Petri nets are used to model the underlying devices, components, connectors and test cases of CPS software. Aspect oriented programming extracts the crosscutting concerns of CPS software testing. The behaviors and their relationships are described based on AOP, and a weaving mechanism is used to dynamically integrate these models into the test model of CPS. The correctness of the model is analyzed by using the operation semantics and related theories of Petri nets. Based on the state space of constructed model, a strategy is proposed to dynamically select the test suite. The experiment results show that this method can effectively describe the CPS software testing process, which can improve the quality of software testing. © 2017 Totem Publisher, Inc. All rights reserved.

关键词： software testing

来源：评论

学校读者我要写书评

暂无评论

A formal aspect-oriented method to model and analyse secure service composition

引用

International Journal of Autonomous and Adaptive Communications Systems 2015年第2-3期8卷 119-140页

作者： Fan, Guisheng Yu, Huiqun Chen, Liqiong Liu, Dongmei Department of Computer Science and Engineering East China University of Science and Technology Shanghai200237 China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai201112 China Department of Computer Science and Information Engineering Shanghai Institute of Technology Shanghai200235 China

Service-oriented computing (SOC) is becoming a prominent paradigm for creating value-added enterprise applications by composing web services. However, this flexibility comes along with new security risks. In this paper, Petri nets are used to precisely describe the different components of service composition, such as service, component, the basic relation between components, etc. The dynamic matching strategy of service composition is proposed, aspect orientation is used to weave it into the base net, which includes evaluation concern, authorisation concern and failure processing concern, the weaving mechanism dynamically integrates these schemas into a secure aspect model. Based on this, the operation semantics and related theories of Petri nets help prove the effectiveness and feasibility of proposed method, the enforcement algorithm is also given. An example explains the modelling process of service composition, and a series of experiments are done to explain that the use of aspects for service composition is more efficient than conventional techniques. © 2015 Inderscience Enterprises Ltd.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

A requirements description language pLSC for probabilistic branches and three-stage events

A requirements description language pLSC for probabilistic b...

引用

ACIS International Conference on software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD)

作者： Jinyu Kai Huaikou Miao Honghao Gao Shanghai Key Laboratory of Computer Software Evaluating & Testing Shanghai P.R. China Computing Center Shanghai University Shanghai P.R. China

The language of Live Sequence Chart (LSC), a multi-modal extension of MSC, introduces the distinction between mandatory and possible on the level of the whole chart and for the chart elements. While the LSC still extend the MSC qualitatively, when it comes to capturing the quantitative behaviors, the deficiency emerges. As for the probabilistic systems, i.e., systems that exhibit probabilistic aspects, probabilistic properties are considered as the most important requirements and need to be captured quantitatively. To address this, we propose a requirements description language called pLSC. Supported by the measure theory and the probability theory, the language pLSC describes the interactions quantitatively to suit the probabilistic systems from two dimensions of probabilistic branches and three-stage events. The paper introduces the graphical and textual presentation of the pLSC.

关键词： Probabilistic logic Markov processes Animals Syntactics Random processes

来源：评论

学校读者我要写书评

暂无评论

SDN-based approach to generating and optimizing test path for cloud application

引用

International Journal of Performability Engineering 2017年第8期13卷 1257-1267页

作者： Chen, Liqiong Liu, Yunxiang Fan, Guisheng Department of Computer Science and Information Engineering Shanghai Institute of Technology Shanghai200235 China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai201112 China Department of Computer Science and Engineering East China University of Science and Technology Shanghai200237 China

With the intensive and large-scale development of cloud computing, software testing has become one of the most important problems. How to evaluate and assess the testing process of a cloud computing system is a key to the deployment and use of it. This paper proposes a method to generate and optimize test paths of cloud application based on SDN, which separates the cloud service testing process from the underlying execution logic, thus improving the scalability of the testing process. The finite state machine (FSM) is used to establish the formal description language of the cloud application testing process, and is also used to model the basic elements, such as cloud services, jobs, test cases and cloud applications, and construct a test model for cloud application. The related theory of FSM is used to analyze the effectiveness and correctness of cloud application test model. Based on the actual mapping of the model, the generation method of test path is also given. In addition, we analyze the coverage of test cases and propose the test path optimization methods to improve the test efficiency. The specific examples and simulations show that this method can simplify the design and analysis of the cloud application testing process and effectively improve the generation of test paths. © 2017 Totem Publisher, Inc. All rights reserved.

关键词： Verification

来源：评论

学校读者我要写书评

暂无评论

An approach to analyzing time constrained service composition

引用

Journal of computers 2011年第8期6卷 1723-1731页

作者： Fan, Guisheng Yu, Huiqun Chen, Liqiong Tong, Ruan Department of Computer Science and Engineering East China University of Science and Technology Shanghai 200237 China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai 200237 China Department of Computer Science and Information Engineering Shanghai Institute of Technology Shanghai 200235 China

Service composition is widely applied in different applications. One key issue is how to model and analyze time-related properties for service composition. A model called service composition time-constrained Petri Net (SCTNet) is proposed in the paper, which is capable of capturing time behavior of services accurately. The basic relationships, priority and preemption between services are characterized, meanwhile the transaction properties of service are also considered. In order to reduce the state space of model, we propose four simplification schemas which can maintain structural feature and time delay of SCT-Net, a theorem is given to explain the rational of simplification schemas. We present the concept of the greatest concurrent set and analyze the consistency of overtime handling based on the state space of the model. Finally, a heuristic algorithm for schedule computation is created and the experiments are given to explain the feasibility of our method. © 2011 ACADEMY PUBLISHER.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

A chain algorithm for conformance testing based on UIO sequences

A chain algorithm for conformance testing based on UIO seque...

引用

ACIS International Conference on software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD)

作者： Weiwei Lin Hongwei Zeng Department of Information Science and Technology Taishan University Shanghai China School of Computer Engineering and Science Shanghai University Shanghai China Shanghai Key Laboratory of Computer Software Evaluating & Testing Shanghai China

State verification to check that the machine is in a specified state is a key technique in FSM-based conformance testing. This paper presents a special UIO sequence called CUIO which can verify as many states as possible and all transitions of FSM simultaneously. CUIO sequences are constructed by a chain algorithm which is proposed based on the traditional method of successor tree. As a result, desirable checking sequence can be obtained by CUIO with relatively low computational complexity.

关键词： testing computers Computational modeling software algorithms software Information science Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Non-structure Data Storage Technology: A Discussion

Non-structure Data Storage Technology: A Discussion

引用

International Conference on computer and Information Science (ACIS)

作者： Shidong Huang Lizhi Cai Zhenyu Liu Yun Hu School of Information Science & Engineering East China University of Science and Technology Shanghai China Shanghai Key Laboratory of Computer Software Evaluating & Testing Shanghai China

The traditional database is designed for the structured data and the complex query. In the environment of the cloud, the scale of data is very large, the data is non-structured, the request of the data is dynamic, these characteristics raise new challenges for the data's storage and administration, in this context, the NoSQL database comes into being. The article compares and analyzes the general structure of the Cassandra, HBase, MongoDB, the data's distribution mechanism in the cluster, the mechanism of the fault tolerance, their support for the programming model and some relevant technologies, in order to provide some references for selecting or building the NoSQL database solution.

关键词： Peer to peer computing Servers Distributed databases Data models File systems Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

An approach to analyzing user preference based dynamic service composition

Journal of Software

引用

Journal of software 2010年第9期5卷 982-989页

作者： Fan, Guisheng Yu, Huiqun Chen, Liqiong Yu, Caizhu Department of Computer Science and Engineering East China University of Science and Technology Shanghai 200237 China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai 201112 China Department of Computer Science and Information Engineering Shanghai Institute of Technology Shanghai 200235 China

As a way to compose independent service together to fulfill a function, service composition is an important means for flexible and rapid information integration of complex distribution application in open and heterogeneous environment. However, the diversity of requirements makes it difficult to guarantee the correctness of service composition. This paper proposes a hierarchical dynamic service composition net (HDSC-net), and user's preference based mechanism for service composition. HDSC-net is used to model operation, the relationships between operations, operation mapping, and user's preference. Transfer matrix is constructed to express the relationships between states, while theories of Petri nets help prove the composability of service. The strategy for dynamic service composition and its corresponding enforcement method are also proposed. A case study of Travel Service demonstrates the applicability of proposed method and its effectiveness. © 2010 Academy Publisher.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：