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

IEEE/ACM 41st International Conference on Software Engineering - Software Engineering in Practice (ICSE-SEIP)

作者： Beszedes, Arpad Horvath, Ferenc Di Penta, Massimiliano Gyimothy, Tibor Univ Szeged Software Engn Dept Szeged Hungary Univ Sannio Dept Engn Benevento Italy

ISBN: (纸本)9781728117645

In Spectrum-Based Fault Localization, program elements such as statements or functions are ranked according to a suspiciousness score which can guide the programmer in finding the fault more efficiently. However, such a ranking does not include any additional information about the element under investigation. In this work, we propose to complement function-level spectrum based fault localization with function call chains - i.e., snapshots of the call stack occurring during execution - on which the fault localization is first performed, and then narrowed down to functions. Our experiments using defects from four Defects4J programs show that (i) 84% of the defective functions can be found in call chains with highest scores, (ii) the proposed approach improves Ochiai ranking of 1 to 6 positions on average, with a relative improvement of 45%, and (iii) the improvement is substantial when Ochiai produces bad rankings.

关键词： Spectrum Based Fault Localization function call chains call stack trace testing and debugging

来源：评论

学校读者我要写书评

暂无评论

Eliminating Path Redundancy via Postconditioned Symbolic Execution

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2018年第1期44卷 25-43页

作者： Yi, Qiuping Yang, Zijiang Guo, Shengjian Wang, Chao Liu, Jian Zhao, Chen Univ Chinese Acad Sci Chinese Acad Sci Natl Engn Res Ctr Fundamental Software Inst Software Beijing 100049 Peoples R China Western Michigan Univ Dept Comp Sci Kalamazoo MI 49008 USA Virginia Tech Dept Elect & Comp Engn Blacksburg VA 24061 USA Univ Southern Calif Dept Comp Sci Los Angeles CA 90007 USA Inst Informat Engn Key Lab Network Assessment Technol Beijing 100195 Peoples R China Inst Informat Engn Beijing Key Lab Network Secur Technol Beijing 100195 Peoples R China Univ Chinese Acad Sci Chinese Acad Sci Beijing 100195 Peoples R China Chinese Acad Sci Natl Engn Res Ctr Fundamental Software Beijing 100864 Peoples R China Chinese Acad Sci State Key Lab Comp Sci Inst Software Beijing 100864 Peoples R China

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 explosionbecause 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. Since the new approach is computationally expensive, we also propose several heuristics to reduce its cost. We have implemented our method in the symbolic execution engine KLEE [1] and conducted experiments on a large set of 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.

关键词： Symbolic execution testing and debugging testing tools

来源：评论

学校读者我要写书评

暂无评论

An Artificial Bee Colony Algorithm for Detecting Distributed Predicates

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SYSTEMS AND TECHNOLOGIES 2018年第3期9卷 53-64页

作者： Al Maghayreh, Eslam King Saud Univ Comp Sci Coll Comp & Informat Sci Muzahmeah Branch Riyadh Saudi Arabia

Developing correct dependable distributed applications is a difficult task. The techniques developed to detect distributed predicates can be used to verify the satisfaction of specific properties (represented as predicates) in a given run of a distributed application. These techniques have several applications including the verification of the correctness of a particular implementation of a distributed system (runtime verification). Due to concurrency, the number of states to be considered in detecting a distributed predicate is exponential. This article investigates the effectiveness of using a meta-heuristic algorithm in solving the problem of detecting distributed predicates. Namely, the authors have used the Artificial Bee Colony algorithm to develop an algorithm to detect distributed predicates. The conducted experiments demonstrate that the ABC-based detection algorithm has a better performance compared with the traditional state enumeration-based detection algorithm.

关键词： Artificial Bee Colony (ABC) Algorithm Distributed Predicates Detection Runtime Verification testing and debugging

来源：评论

学校读者我要写书评

暂无评论

Semi-Proving: An Integrated Method for Program Proving, testing, and debugging

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2011年第1期37卷 109-125页

作者： Chen, Tsong Yueh Tse, T. H. Zhou, Zhi Quan Swinburne Univ Technol Ctr Software Anal & Testing Hawthorn Vic 3122 Australia Univ Hong Kong Dept Comp Sci Pokfulam Hong Kong Peoples R China Univ Wollongong Sch Comp Sci & Software Engn Wollongong NSW 2522 Australia

We present an integrated method for program proving, testing, and debugging. Using the concept of metamorphic relations, we select necessary properties for target programs. For programs where global symbolic evaluation can be conducted and the constraint expressions involved can be solved, we can either prove that these necessary conditions for program correctness are satisfied or identify all inputs that violate the conditions. For other programs, our method can be converted into a symbolic-testing approach. Our method extrapolates from the correctness of a program for tested inputs to the correctness of the program for related untested inputs. The method supports automatic debugging through the identification of constraint expressions that reveal failures.

关键词： Software/program verification symbolic execution testing and debugging

来源：评论

学校读者我要写书评

暂无评论

Test Automation for Speech-Based Applications 15

Test Automation for Speech-Based Applications

引用

15th International Conference on New Trends in Intelligent Software Methodology Tools, and Techniques (SoMeT)

作者： Griebe, Tobias Hesenius, Marc Gesthuesen, Marc Gruhn, Volker Univ Duisburg Essen Paluno Ruhr Inst Software Technol Gerlingstr 16 Essen Germany

ISBN: (纸本)9781614996743;9781614996736

testing is a crucial activity to maintain high quality standards and achieve long-lasting economic success. However, integrating voice control into apps prevents the use of test automation tools. testing speech-based interaction is still manual work: repetitive, time-consuming, and error-prone. Consequently, a need for specialized software engineering methods exists. We present an approach to test automation for speech-based applications by integrating an audio injection test interface into the Android operating system. Our approach enables developers to integrate voice control into automatically executed user acceptance tests using the Calabash test automation framework.

关键词： testing and debugging Voice Interaction Android

来源：评论

学校读者我要写书评

暂无评论

Statistical debugging Effectiveness as a Fault Localization Approach: Comparative Study

引用

Journal of Software Engineering and Applications 2016年第8期9卷 412-423页

作者： Ishaq Sandoqa Fawaz Alzghoul Hamad Alsawalqah Isra Alzghoul Loai Alnemer Mohammad Akour Department of Computer Information Systems The University of Jordan Amman Jordan Department of Computer Information System Yarmouk University Irbid Jordan

Fault localization is an important topic in software testing, as it enables the developer to specify fault location in their code. One of the dynamic fault localization techniques is statistical debugging. In this study, two statistical debugging algorithms are implemented, SOBER and Cause Isolation, and then the experimental works are conducted on five programs coded using Python as an example of well-known dynamic programming language. Results showed that in programs that contain only single bug, the two studied statistical debugging algorithms are very effective to localize a bug. In programs that have more than one bug, SOBER algorithm has limitations related to nested predicates, rarely observed predicates and complement predicates. The Cause Isolation has limitations related to sorting predicates based on importance and detecting bugs in predicate condition. The accuracy of both SOBER and Cause Isolation is affected by the program size. Quality comparison showed that SOBER algorithm requires more code examination than Cause Isolation to discover the bugs.

关键词： testing and debugging Dynamic Language Statistical debugging Fault Localization

来源：评论

学校读者我要写书评

暂无评论

Cooperative Software testing and Analysis: Advances and Challenges

引用

Journal of Computer Science & Technology 2014年第4期29卷 713-723页

作者：谢涛张路肖旭生熊英飞郝丹 ACM IEEE Department of Computer Science University of Illinois at Urbana-Champaign Urbana IL 61801 U.S.A. CCF Key Laboratory of High Confidence Software Technologies Ministry of Education Institute of Software School of Electronics Engineering and Computer Science Peking University NEC Laboratories America Inc. Princeton NJ 08520 U.S.A.

In recent years, to maximize the value of software testing and analysis, we have proposed the methodology of cooperative software testing and analysis （in short as cooperative testing and analysis） to enable testing and analysis tools to cooperate with their users （in the form of tool-human cooperation）, and enable one tool to cooperate with another tool （in the form of tool-tool cooperation）. Such cooperations are motivated by the observation that a tool is typically not powerful enough to address complications in testing or analysis of complex real-world software, and the tool user or another tool may be able to help out some problems faced by the tool. To enable tool-human or tool-tool cooperation, effective mechanisms need to be developed 1） for a tool to communicate problems faced by the tool to the tool user or another tool, and 2） for the tool user or another tool to assist the tool to address the problems. Such methodology of cooperative testing and analysis forms a new research frontier on synergistic cooperations between humans and tools along with cooperations between tools and tools. This article presents recent example advances and challenges on cooperative testing and analysis.

关键词： software verification testing and debugging software quality

来源：评论

学校读者我要写书评

暂无评论

Static test case prioritization using topic models

引用

EMPIRICAL SOFTWARE ENGINEERING 2014年第1期19卷 182-212页

作者： Thomas, Stephen W. Hemmati, Hadi Hassan, Ahmed E. Blostein, Dorothea Queens Univ Sch Comp Kingston ON Canada

Software development teams use test suites to test changes to their source code. In many situations, the test suites are so large that executing every test for every source code change is infeasible, due to time and resource constraints. Development teams need to prioritize their test suite so that as many distinct faults as possible are detected early in the execution of the test suite. We consider the problem of static black-box test case prioritization (TCP), where test suites are prioritized without the availability of the source code of the system under test (SUT). We propose a new static black-box TCP technique that represents test cases using a previously unused data source in the test suite: the linguistic data of the test cases, i.e., their identifier names, comments, and string literals. Our technique applies a text analysis algorithm called topic modeling to the linguistic data to approximate the functionality of each test case, allowing our technique to give high priority to test cases that test different functionalities of the SUT. We compare our proposed technique with existing static black-box TCP techniques in a case study of multiple real-world open source systems: several versions of Apache Ant and Apache Derby. We find that our static black-box TCP technique outperforms existing static black-box TCP techniques, and has comparable or better performance than two existing execution-based TCP techniques. Static black-box TCP methods are widely applicable because the only input they require is the source code of the test cases themselves. This contrasts with other TCP techniques which require access to the SUT runtime behavior, to the SUT specification models, or to the SUT source code.

关键词： testing and debugging Test case prioritization Topic models

来源：评论

学校读者我要写书评

暂无评论

Using Branch Predictors and Variable Encoding for On-the-Fly Program Tracing

引用

IEEE TRANSACTIONS ON COMPUTERS 2014年第4期63卷 1008-1020页

作者： Uzelac, Vladimir Milenkovic, Aleksandar Milenkovic, Milena Burtscher, Martin Tensilica Inc Santa Clara CA 95054 USA Univ Alabama Dept Elect & Comp Engn Huntsville AL 35899 USA IBM Corp Madison AL 35757 USA Texas State Univ San Marcos Dept Comp Sci San Marcos TX 78666 USA

Unobtrusive capturing of program execution traces in real-time is crucial for debugging many embedded systems. However, tracing even limited program segments is often cost-prohibitive, requiring wide trace ports and large on-chip trace buffers. This paper introduces a new cost-effective technique for capturing and compressing program execution traces on-the-fly. It relies on branch predictor-like structures in the trace module and corresponding software modules in the debugger to significantly reduce the number of events that need to be streamed out of the target system. Coupled with an effective variable encoding scheme that adapts to changing program patterns, our technique requires merely 0.029 bits per instruction of trace port bandwidth, providing a 34-fold improvement over the commercial state-of-the-art and a five-fold improvement over academic proposals, at the low cost of under 5,000 logic gates.

关键词： Compression technologies real time and embedded systems testing and debugging tracing

来源：评论

学校读者我要写书评

暂无评论

A Technique for Deploying Robust Web Services

引用

IEEE TRANSACTIONS ON SERVICES COMPUTING 2014年第1期7卷 68-81页

作者： Laranjeiro, Nuno Vieira, Marco Madeira, Henrique Univ Coimbra Dept Informat Engn Ctr Informat & Syst P-3030329 Coimbra Portugal

Developing robust web services is a difficult task. Field studies show that a large number of web services are deployed with robustness problems (i.e., presenting unexpected behaviors in the presence of invalid inputs). Although several techniques for the identification of robustness problems have been proposed in the past, there is no practical approach to automatically fix those problems. This paper proposes a mechanism that automatically fixes robustness problems in web services. The approach consists of using robustness testing to detect robustness issues and then mitigate those issues by applying inputs verification based on well-defined parameter domains, including domain dependencies between different parameters. This integrated and fully automated methodology has been used to improve three different implementations of the TPC-App web services and several services publicly available on the Internet. Results show that the proposed approach can be easily used to improve the robustness of web services code.

关键词： Code tuning interoperability reliability testing and debugging

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：