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

Test scenario generation using model checking

International Journal of Performability engineering 2018年第6期14卷 1241-1250页

作者： Yin, Zhixiong Zhang, Min Li, Guoqiang Fang, Ling School of Engineering Sciences University of Chinese Academy of Sciences Beijing100049 China Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai200062 China School of Software Shanghai Jiao Tong University Shanghai200240 China Institute of Technology Innovation Hefei Institutes of Physical Science Chinese Academy of Sciences Hefei230031 China

Testing, including designation, execution and bug analysis has been broadly adopted in various industries. Test cases must be designed to confirm the entire behavior of the object system. In practice, a test case normally includes a series of operations that cold conduct the system status eventually to fulfill the precondition of the targeted test case. However, the applications to trigger the function calls of the software system would often be manually composed in traditional test activities, which is difficult especially for complex concurrent systems. Insufficient testing might result in hidden system defects, which increases the likelihood of economic loss or human injury. Model checking is a formal technique that can check the properties of a system automatically with strictness, completeness, and traceability. In this paper, a novel formal approach is proposed to systematically generate test scenarios automatically with traceability by the model checking technique. Meanwhile, the scenarios are reliable and precise, and debugging also becomes easier. Moreover, despite the reduction in demand of an experienced test engineer to design the target test cases, the coverage could be improved as the tedious and complicated processes of test scenario generation are accomplished by the model checker. This method has been applied in two practical case studies, and the results show the effectiveness of the proposed approach in terms of high coverage, automation, traceability and reusability. © 2018 Totem Publisher, Inc. All rights reserved.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

The medical segmentation decathlon

arXiv

引用

arXiv 2021年

作者： Antonelli, Michela Reinke, Annika Bakas, Spyridon Farahani, keyvan Kopp-Schneider, Annette Landman, Bennett A. Litjens, Geert Menze, Bjoern Ronneberger, Olaf Summers, Ronald M. van Ginneken, Bram Bilello, Michel Bilic, Patrick Christ, Patrick F. Do, Richard K.G. Gollub, Marc J. Heckers, Stephan H. Huisman, Henkjan Jarnagin, William R. McHugo, Maureen K. Napel, Sandy Golia Pernicka, Jennifer S. Rhode, Kawal Tobon-Gomez, Catalina Vorontsov, Eugene Hulsmon, Hankan Meakin, James A. Ourselin, Sebastien Wiesenfarth, Manuel Arbeláez, Pablo Bae, Byeonguk Chen, Sihong Daza, Laura Feng, Jianjiang He, Baochun Isensee, Fabian Ji, Yuanfeng Jia, Fucang Kim, Namkug Kim, Ildoo Merhof, Dorit Pai, Akshay Park, Beomhee Perslev, Mathias Rezaiifar, Ramin Rippel, Oliver Sarasua, Ignacio Shen, Wei Son, Jaemin Wachinger, Christian Wang, Liansheng Wang, Yan Xia, Yingda Xu, Daguang Xu, Zhanwei Zheng, Yefeng Simpson, Amber L. Maier-Hein, Lena Cardoso, M. Jorge School of Biomedical Engineering & Imaging Sciences King’s College London London United Kingdom Heidelberg Germany Heidelberg Germany Faculty of Mathematics and Computer Science University of Heidelberg Heidelberg Germany University of Pennsylvania PhiladelphiaPA United States BethesdaMD United States Heidelberg Germany Electrical Engineering and Computer Science Vanderbilt University NashvilleTN United States Radboud University Medical Center Radboud Institute for Health Sciences Nijmegen Netherlands Quantitative Biomedicine University of Zurich Zurich Switzerland DeepMind London United Kingdom School of Computing Department of Biomedical and Molecular Sciences Queen’s University KingstonON Canada Department of Surgery Memorial Sloan Kettering Cancer Center New YorkNY United States BethesdaMD United States Department of Informatics Technische Universität München Germany Department of Radiology Memorial Sloan Kettering Cancer Center New YorkNY United States Department of Psychiatry & Behavioral Sciences Vanderbilt University Medical Center NashvilleTN United States Department of Radiology Stanford University StanfordCA United States Department of Computer Science and Software Engineering École Polytechnique de Montréal Department of Radiology Perelman School of Medicine University of Pennsylvania PhiladelphiaPA United States Department of Pathology and Laboratory Medicine Perelman School of Medicine University of Pennsylvania PhiladelphiaPA United States Medical Faculty University of Heidelberg Heidelberg Germany VUNO Inc. Seoul Korea Republic of Universidad de los Andes Colombia Department of Automation Tsinghua University Beijing China Heidelberg Germany Department of Computer Science Xiamen University Xiamen361005 China Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen China Kakao Brain Korea Republic of Institute of Imaging & Computer Vision RWTH Aachen University Aachen Germany Cere

International challenges have become the de facto standard for comparative assessment of image analysis algorithms given a specific task. Segmentation is so far the most widely investigated medical image processing task, but the various segmentation challenges have typically been organized in isolation, such that algorithm development was driven by the need to tackle a single specific clinical problem. We hypothesized that a method capable of performing well on multiple tasks will generalize well to a previously unseen task and potentially outperform a custom-designed solution. To investigate the hypothesis, we organized the Medical Segmentation Decathlon (MSD)—a biomedical image analysis challenge, in which algorithms compete in a multitude of both tasks and modalities. The underlying data set was designed to explore the axis of difficulties typically encountered when dealing with medical images, such as small data sets, unbalanced labels, multi-site data and small objects. The MSD challenge confirmed that algorithms with a consistent good performance on a set of tasks preserved their good average performance on a different set of previously unseen tasks. Moreover, by monitoring the MSD winner for two years, we found that this algorithm continued generalizing well to a wide range of other clinical problems, further confirming our hypothesis. Three main conclusions can be drawn from this study: (1) state-of-the-art image segmentation algorithms are mature, accurate, and generalize well when retrained on unseen tasks;(2) consistent algorithmic performance across multiple tasks is a strong surrogate of algorithmic generalizability;(3) the training of accurate AI segmentation models is now commoditized to non AI *** Codes 68T07. © 2021, CC BY-NC-SA.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Accountable multi-authority ciphertext-policy attribute-based encryption without key escrow and key abuse 9th

Accountable multi-authority ciphertext-policy attribute-base...

引用

9th International Symposium on Cyberspace Safety and Security, CSS 2017

作者： Yu, Gang Ma, Xiaoxiao Cao, Zhenfu Zhu, Weihua Zeng, Junjie State Key Laboratory of Mathematical Engineering and Advanced Computing Information Science and Technology Institute Zhengzhou450001 China Shanghai Key Lab for Trustworthy Computing East China Normal University Shanghai200062 China Zheng Zhou Vocational University of Information and Technology Zhengzhou450046 China

ISBN: (纸本)9783319694702

Ciphertext-policy attribute-based encryption (CP-ABE) is a promising public key encryption primitive enabling fine-grained access control on shared data in public cloud. However, two quite challenging issues, the prevention of key escrow and key abuse, still exist in CP-ABE system. In this paper, we propose a multi-authority CP-ABE scheme without key escrow and key abuse. To prevent key escrow, multiple authorities are employed to perform the same procedure of key generation for an attribute. Thus, no individual authority or colluded authorities that manage no common attribute can decrypt any ciphertext, and it can also resist collusion attack from curious authority with the help of dishonest users. To prevent key abuse of dishonest users, user’s global identifier along with a signature is embedded into the secret key. Thus, any third party can learn the identity from a shared secret key and publicly verify its validity. An advantage of simultaneously preventing key escrow and key abuse is that the proposed scheme can achieve accountability, i.e. an auditor can publicly audit a user or authorities abuse the secret key. At last, the proposed scheme is fully secure in the random oracle model, and due to a key aggregate algorithm its efficiency is comparable to the decentralizing CP-ABE scheme [18] on which it is based. © 2017, Springer International Publishing AG.

关键词： Access control

来源：评论

学校读者我要写书评

暂无评论

Large-scale analysis of framework-specific exceptions in android apps

arXiv

引用

arXiv 2018年

作者： Fan, Lingling Su, Ting Chen, Sen Meng, Guozhu Liu, Yang Xu, Lihua Pu, Geguang Su, Zhendong School of Computer Science and Software Engineering East China Normal University China School of Computer Science and Engineering Nanyang Technological University Singapore SKLOIS Institute of Information Engineering Chinese Academy of Sciences China Shanghai Key Laboratory of Trustworthy Computing East China Normal University China Department of Computer Science University of California Davis United States

Mobile apps have become ubiquitous. For app developers, it is a key priority to ensure their apps' correctness and reliability. However, many apps still suffer from occasional to frequent crashes, weakening their competitive edge. Large-scale, deep analyses of the characteristics of real-world app crashes can provide useful insights to guide developers, or help improve testing and analysis tools. However, such studies do not exist - this paper fills this gap. Over a four-month long effort, we have collected 16,245 unique exception traces from 2,486 open-source Android apps, and observed that framework-specific exceptions account for the majority of these crashes. We then extensively investigated the 8,243 frameworkspecific exceptions (which took six person-months): (1) identifying their characteristics (e.g., manifestation locations, common fault categories), (2) evaluating their manifestation via state-of-the-art bug detection techniques, and (3) reviewing their fixes. Besides the insights they provide, these findings motivate and enable follow-up research on mobile apps, such as bug detection, fault localization and patch generation. In addition, to demonstrate the utility of our findings, we have optimized Stoat, a dynamic testing tool, and implemented ExLocator, an exception localization tool, for Android apps. Stoat is able to quickly uncover three previously-unknown, confirmed/fixed crashes in Gmail and Google+;ExLocator is capable of precisely locating the root causes of identified exceptions in real-world apps. Our substantial dataset is made publicly available to share with and benefit the community. Copyright © 2018, The Authors. All rights reserved.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

Perturbation techniques for convergence analysis of proximal gradient method and other first-order algorithms via variational analysis

arXiv

引用

arXiv 2018年

作者： Wang, Xiangfeng Ye, Jane J. Yuan, Xiaoming Zeng, Shangzhi Zhang, Jin Shanghai Key Lab for Trustworthy Computing School of Computer Science and Software Engineering East China Normal University China Department of Mathematics and Statistics University of Victoria Canada Department of Mathematics University of Hong Kong Hong Kong Hong Kong Department of Mathematics University of Hong Kong Hong Kong Hong Kong Department of Mathematics Hong Kong Baptist University Hong Kong HKBU Institute of Research and Continuing Education Shenzhen China

We develop new perturbation techniques for conducting convergence analysis of various first-order algorithms for a class of nonsmooth optimization problems. We consider the iteration scheme of an algorithm to construct a perturbed stationary point set-valued map, and define the perturbing parameter by the difference of two consecutive iterates. Then, we show that the calmness condition of the induced set-valued map, together with a local version of the proper separation of stationary value condition, is a sufficient condition to ensure the linear convergence of the algorithm. The equivalence of the calmness condition to the one for the canonically perturbed stationary point set-valued map is proved, and this equivalence allows us to derive some sufficient conditions for calmness by using some recent developments in variational analysis. These sufficient conditions are different from existing results (especially, those error-bound-based ones) in that they can be easily verified for many concrete application models. Our analysis is focused on the fundamental proximal gradient (PG) method, and it enables us to show that any accumulation of the sequence generated by the PG method must be a stationary point in terms of the proximal subdifferential, instead of the limiting subdifferential. This result finds the surprising fact that the solution quality found by the PG method is in general superior. Our analysis also leads to some improvement for the linear convergence results of the PG method in the convex case. The new perturbation technique can be conveniently used to derive linear rate convergence of a number of other first-order methods including the well-known alternating direction method of multipliers and primal-dual hybrid gradient method, under mild assumptions. Copyright © 2018, The Authors. All rights reserved.

关键词： Gradient methods

来源：评论

学校读者我要写书评

暂无评论

AdaRate: A rate-adaptive traffic measurement method in software defined networks

引用

International Journal of Performability engineering 2017年第6期13卷 937-944页

作者： Tang, Jixing Zhang, Yue Li, Yan MoE Engineering Research Center for Software/Hardware Co-Design Technology and Application East China Normal University Shanghai200062 China Shanghai Key Lab for Trustworthy Computing East China Normal University Shanghai200062 China

Traffic measurement is the basis of analysis and prediction of network traffic. Its accuracy directly affects the reliability of upper applications. This paper proposes a rate-adaptive traffic measurement method called AdaRate. It adjusts the polling period according to fluctuations of flow rates which is calculated with a sliding window queue. We noticed that some fluctuations of flow rates may be dropped in AdaRate while the polling period is too long. Then we propose RAdaRate. It adjusts the polling period according to AdaRate or sets the polling period to minimum randomly. We compared the performance of AdaRate and RAdaRate with SWT in CeMon and Payless in Mininet when monitoring those VBR flows with frequent and large fluctuation. The results show that the accuracy of RAdaRate is the best while the overhead of AdaRate is the least. The overhead of AdaRate is 68.75% less than periodic polling. © 2017 Totem Publisher, Inc. All rights reserved.

关键词： software defined networking

来源：评论

学校读者我要写书评

暂无评论

Comparison and evaluation of routing protocols based on a collaborative simulation using SUMO and NS3 with TraCI

Comparison and evaluation of routing protocols based on a co...

引用

2016 International Conference on Information System and Artificial Intelligence, ISAI 2016

作者： Yang, Yue Hao, Si-Yuan Cai, Ha-Bin Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai China Software Engineering Institute East China Normal University Shanghai China

ISBN: (纸本)9781509015856

Vehicle Ad hoc Network (VANET) is an emerging technology and a new application of mobile Ad Hoc technology in the field of traffic. As the simulation experiments cost less manpower and material resources and they are easy to reproduce the same scenario, VANET simulation technology has become a focus of scholars. But node mobility is strictly limited in the realistic traffic environment and fast moving speed leads to more frequent changes in network topology. So in VANET simulation, it is not appropriate to use traffic simulation tools or network simulation tools alone. In this paper, we integrated SUMO, middleware tool TraCI with NS3 to compare and evaluate the performance of four different topology based routing protocols. They are AODV, DSR, TORA and DSDV. We changed the node mobility and density to observe the experiment results. The main performance metrics for protocols are Packet Drop Ratio, Average Delay and Normalized Routing Load. We concluded that there are many differences and advantages under the proactive and reactive routing protocols from the values of metrics. © 2016 IEEE.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

On the Convergence Rate of a Class of Proximal-Based Decomposition Methods for Monotone Variational Inequalities

引用

Journal of the Operations Research Society of China 2015年第3期3卷 347-362页

作者： Xiang-Feng Wang Shanghai Key Lab for Trustworthy Computing Software Engineering InstituteEast China Normal UniversityShanghai 200062China

A unified efficient algorithm framework of proximal-based decomposition methods has been proposed for monotone variational inequalities in 2012,while only global convergence is proved at the same *** this paper,we give a unified proof on theO(1/t)iteration complexity,together with the linear convergence rate for this kind of proximal-based decomposition *** theε-optimal iteration complexity result defined by variational inequality,the non-ergodic relative error of adjacent iteration points is also proved to decrease in the same ***,the linear convergence rate of this algorithm framework can be constructed based on some special variational inequality properties,without necessary strong monotone conditions.

关键词： Variational inequality Proximal point algorithm Iteration complexity Relative error Convergence rate Error bound

来源：评论

学校读者我要写书评

暂无评论

Improving Defect Detection Ability of Derived Test Cases Based on Mutated UML Activity Diagrams

Improving Defect Detection Ability of Derived Test Cases Bas...

引用

IEEE Annual International Computer software and Applications Conference (COMPSAC)

作者： Haiying Sun Mingsong Chen Min Zhang Jing Liu Ying Zhang Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai China Software Engineering Institute East China Normal University Shanghai China

Structure coverage driven test generation is the key approach for automatic testing at source code level. However, the defect detection ability of the generated test cases should be carefully evaluated since the correlation between coverage and test effectiveness is in doubt. In this paper, we propose a test generation approach based on mutation testing with the intent to derive test cases towards finding defects rather than just covering certain syntactic structures. Moreover, instead of generating test cases from the code under test directly, we base our approach on UML activity diagrams to make it possible to decide verdicts of test inputs. Mutation operators for activity diagrams are defined and the test generation algorithms are based on solving mutated path constraints. Experimental results have shown that by applying the proposed mutated testing approach, test cases with higher defect detection ability can be generated.

关键词： Testing Unified modeling language Pins software Electronic mail Correlation

来源：评论

学校读者我要写书评

暂无评论

Comparison and Evaluation of Routing Protocols Based on a Collaborative Simulation Using SUMO and NS3 with TraCI

Comparison and Evaluation of Routing Protocols Based on a Co...

引用

International Conference on Information System and Artificial Intelligence (ISAI)

作者： Yue Yang Si-Yuan Hao Ha-Bin Cai Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai China Software Engineering Institute East China Normal University Shanghai China

ISBN: (纸本)9781509015863

关键词： Routing protocols Vehicles Routing Vehicular ad hoc networks Roads Delays

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：