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

International Symposium on Performance Evaluation of Computer and Telecommunication Systems

作者： Eviatar Khen Nezer J. Zaidenberg Amir Averbuch Evgeny Fraimovitch School of Computer Science Tel Aviv University Department of Mathematical Information Technology University of Jyvaskyla

ISBN: (纸本)9781479907175

We present LgDb 2.0. The second generation of LgDb, an innovative framework for kernel code coverage, profiling and simulation. LgDb is built on top of Lguest and allows running an inspected kernel on a virtual environment instead of modifying the running kernel or using an extra target machine. LgDb 2.0 is using the Lguest hypervisor and the KGDB kernel debugger to debug and instrument kernel code. Unlike the standard approaches, LgDb enlist the hypervisor to achieve a better debugging environment for kernel development. LgDb strives to provide a generic environment for running performance evaluation and checking decision coverage for any inspected kernel. LgDb 2.0 improves over the original LgDb by using a simulated serial port and inspecting the tested code using KGDB. By using KGDB we eliminate the need for code injections making, profiling and code coverage testing easier.

关键词： Virtualization Debugging code coverage Profiling Linux Kernel Lguest

来源：评论

学校读者我要写书评

暂无评论

On the coverage of Program code by Specification-based Tests

On the Coverage of Program Code by Specification-based Tests

引用

9th International Conference on Quality Software (QSIC 2009)

作者： Yu, Y. T. Chan, Eric Y. K. Poon, P. -L. City Univ Hong Kong Dept Comp Sci Kowloon Tong Hong Kong Peoples R China Honkong Polytech Univ Hung Hom Sch Accounting & Finance Kowloon Hong Kong Peoples R China

ISBN: (纸本)9781424459124

Generating test cases from the specification can be done early in the software development life cycle. A test suite systematically generated from the software specification can be comprehensive in ensuring the intended functions to be exercised. Such a test suite is also instrumental in facilitating early discovery of software defects. On the other hand, an adequate level of code coverage is required to inspire confidence of the testing and quality assurance process. To examine the effectiveness of a specification-based test suite in covering program code, we conducted an exploratory case study which involved many different versions of programs that implemented the same specification. On the basis of the case study, this paper identifies the types of path in the programs, suggests enhancements to the existing test generation methods, and discusses several issues on how the code coverage can be improved.

关键词： category-partition method classification-tree method code coverage path coverage specification-based testing

来源：评论

学校读者我要写书评

暂无评论

UML Associations Reducing the Gap in Test coverage between Model and code 4

UML Associations <i>Reducing the Gap in Test Coverage betwee...

引用

4th International Conference on Model-Driven Engineering and Software Development (MODELSWARD)

作者： Eriksson, Anders Lindstrom, Birgitta Univ Skovde Sch Informat Skovde Sweden Saab Aeronaut Linkoping Sweden

ISBN: (纸本)9789897582325

This paper addresses the overall problem of estimating the quality of a test suite when testing is performed at a platform-independent level, using executable UML models. The problem is that the test suite is often required to fulfill structural code coverage criteria. In the avionics domain it is usually required that the tests achieve 100% coverage according to logic-based coverage criteria. Such criteria are less effective when applied to executable UML models than when they are applied to code because the action code found in such models contains conditions in navigation and loops that are not explicit and therefore not captured by logic-based coverage criteria. We present two new coverage criteria for executable UML models, and we use an industrial application from the avionics domain to show that these two criteria should be combined with a logic-based criterion when testing the executable UML model. As long as the coverage is less than 100% at the model level, there is no point in running the tests at the code level since all functionality of the model is not yet tested, and this is necessary to achieve 100% coverage at the code level.

关键词： Model coverage code coverage UML Association fUML ALF MDA xtUML

来源：评论

学校读者我要写书评

暂无评论

MFTCP: Multiple Factors Based Test Case Prioritization

MFTCP: Multiple Factors Based Test Case Prioritization

引用

11th International Symposium on Computational Intelligence and Industrial Applications, ISCIIA 2024

作者： Cui, Can Wang, Zhi Wang, Shihai Liu, Bin North China Institute of Computing Technology Beijing 100083 China Beihang University Beijing 100191 China

ISBN: (纸本)9789819647552

In software regression testing, reorder the test cases to ensure the modified code does not introduce new effects and keep function right. Traditional coverage-based test case prioritization (TCP) approaches are Total and Additional. These two approaches only use code coverage as the measure to rank the test cases. Several defect prediction-based TCP approaches integrate the defect prediction probability and code coverage with weighting coefficients. However, previous methods need to have a priori knowledge related to defects, which is difficult to obtain. Therefore, we proposed an approach named MFTCP by consider code coverage, defect prediction probability, and lines of code (LoC) with automatic weighting coefficients to rank regression test cases. The experimental results indicate the proposed method is more effective than the baselines, especially in terms of the total strategy. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： code coverage Defect Prediction (DP) Software Testing Test Case Prioritization (TCP)

来源：评论

学校读者我要写书评

暂无评论

Test suite reduction methods that decrease regression testing costs by identifying irreplaceable tests

引用

INFORMATION AND SOFTWARE TECHNOLOGY 2014年第10期56卷 1322-1344页

作者： Lin, Chu-Ti Tang, Kai-Wei Kapfhammer, Gregory M. Natl Chiayi Univ Dept Comp Sci & Informat Engn Chiayi Taiwan Inst Informat Ind Cloud Syst Software Inst Taipei Taiwan Allegheny Coll Dept Comp Sci Meadville PA 16335 USA

Context: In software development and maintenance, a software system may frequently be updated to meet rapidly changing user requirements. New test cases will be designed to ensure the correctness of new or modified functions, thus gradually increasing the test suite's size. Test suite reduction techniques aim to decrease the cost of regression testing by removing the redundant test cases from the test suite and then obtaining a representative set of test cases that still yield a high level of code coverage. Objective: Most of the existing reduction algorithms focus on decreasing the test suite's size. Yet, the differences in execution costs among test cases are usually significant and it may take a lot of execution time to run a test suite consisting of a few long-running test cases. This paper presents and empirically evaluates cost-aware algorithms that can produce the representative sets with lower execution costs. Method: We first use a cost-aware test case metric, called Irreplaceability, and its enhanced version, called Elrreplaceability, to evaluate the possibility that each test case can be replaced by others during test suite reduction. Furthermore, we construct a cost-aware framework that incorporates the concept of test irreplaceability into some well-known test suite reduction algorithms. Results: The effectiveness of the cost-aware framework is evaluated via the subject programs and test suites collected from the Software-artifact Infrastructure Repository - frequently chosen benchmarks for experimentally evaluating test suite reduction methods. The empirical results reveal that the presented algorithms produce representative sets that normally incur a low cost to yield a high level of test coverage. Conclusion: The presented techniques indeed enhance the capability of the traditional reduction algorithms to reduce the execution cost of a test suite. Especially for the additional Greedy algorithm, the presented techniques decrease the costs of the repre

关键词： Software testing Regression testing Test suite reduction code coverage Test irreplaceability

来源：评论

学校读者我要写书评

暂无评论

UCov: a user-defined coverage criterion for test case intent verification

引用

SOFTWARE TESTING VERIFICATION & RELIABILITY 2016年第6期26卷 460-491页

作者： Abou Assi, Rawad Masri, Wes Zaraket, Fadi Amer Univ Beirut Elect & Comp Engn Dept Beirut 11072020 Lebanon

The goal of regression testing is to ensure that the behaviour of existing code, believed correct by previous testing, is not altered by new program changes. This paper argues that the primary focus of regression testing should be on code associated with (1) earlier bug fixes and (2) particular application scenarios considered to be important by the developer or tester. Existing coverage criteria do not enable such focus, for example, 100% branch coverage does not guarantee that a given bug fix is exercised or a given application scenario is tested. Therefore, there is a need for a new and complementary coverage criterion in which the user can definea test requirement characterizing a given behaviour to be covered as opposed to choosing from a pool of pre-defined and generic program elements. This paper proposes this new methodology and calls it UCov, a user-defined coverage criterion wherein a test requirement is an execution pattern of program elements, and possibly predicates, that a test case must satisfy. The proposed criterion is not meant to replace existing criteria, but to complement them as it focuses the testing on important code patterns that could go untested otherwise. UCov supports test case intent verification. For example, following a bug fix, the testing team may augment the regression suite with the test case that revealed the bug. However, this test case might become obsolete due to code modifications not related to the bug. But if a test requirement characterizing the bug was defined by the user, UCov would determine that test case intent verification failed. The UCov methodology was implemented for the Java platform, was successfully applied onto 10 real-life case studies and was shown to have advantages over JUnit. The implementation comprises the following tools: (1) TRSpec: allows the user to easily specify complex test requirements;(2) TRCheck: checks whether user-defined test requirements were satisfied, that is, supports test case intent

关键词： software testing code coverage regression testing validation testing user-defined coverage criterion test case intent verification test case intent preservation

来源：评论

学校读者我要写书评

暂无评论

coverage-Based Debloating for Java Bytecode

引用

ACM TRANSACTIONS ON SOFTWARE ENGINEERING AND METHODOLOGY 2023年第2期32卷 1-34页

作者： Soto-Valero, Cesar Durieux, Thomas Harrand, Nicolas Baudry, Benoit KTH Royal Inst Technol Dept Software & Comp Syst Stockholm Sweden

Software bloat is code that is packaged in an application but is actually not necessary to run the application. The presence of software bloat is an issue for security, performance, and for maintenance. In this article, we introduce a novel technique for debloating, which we call coverage-based debloating. We implement the technique for one single language: Java bytecode. We leverage a combination of state-of-the-art Java bytecode coverage tools to precisely capture what parts of a project and its dependencies are used when running with a specific workload. Then, we automatically remove the parts that are not covered, in order to generate a debloated version of the project. We succeed to debloat 211 library versions from a dataset of 94 unique opensource Java libraries. The debloated versions are syntactically correct and preserve their original behaviour according to the workload. Our results indicate that 68.3 % of the libraries' bytecode and 20.3 % of their total dependencies can be removed through coverage-based debloating. For the first time in the literature on software debloating, we assess the utility of debloated libraries with respect to client applications that reuse them. We select 988 client projects that either have a direct reference to the debloated library in their source code or which test suite covers at least one class of the libraries that we debloat. Our results show that 81.5 % of the clients, with at least one test that uses the library, successfully compile and pass their test suite when the original library is replaced by its debloated version.

关键词： Software bloat code coverage program specialization bytecode software maintenance

来源：评论

学校读者我要写书评

暂无评论

Cause reduction: delta debugging, even without bugs

引用

SOFTWARE TESTING VERIFICATION & RELIABILITY 2016年第1期26卷 40-68页

作者： Groce, Alex Alipour, Mohammad Amin Zhang, Chaoqiang Chen, Yang Regehr, John Oregon State Univ Corvallis OR 97331 USA Univ Utah Salt Lake City UT 84112 USA

What is a test case for? Sometimes, to expose a fault. Tests can also exercise code, use memory or time, or produce desired output. Given a desired effect, a test case can be seen as a cause, and its components divided into essential (required for effect) and accidental. Delta debugging is used for removing accidents from failing test cases, producing smaller test cases that are easier to understand. This paper extends delta debugging by simplifying test cases with respect to arbitrary effects, a generalization called cause reduction. Suites produced by cause reduction provide effective quick tests for real-world programs. For Mozilla's JavaScript engine, the reduced suite is possibly more effective for finding faults. The effectiveness of reduction-based suites persists through changes to the software, improving coverage by over 500 branches for versions up to 4months later. Cause reduction has other applications, including improving seeded symbolic execution, where using reduced tests can often double the number of additional branches explored. Copyright (c) 2015 John Wiley & Sons, Ltd.

关键词： test case minimization regression testing delta debugging code coverage software testing

来源：评论

学校读者我要写书评

暂无评论

Improving coverage and Vulnerability Detection in Smart Contract Testing Using Self-Adaptive Learning GA

引用

IETE JOURNAL OF RESEARCH 2024年第2期70卷 1593-1606页

作者： Sujeetha, R. Akila, K. SRM Inst Sci & Technol Coll Engn & Technol Dept Comp Sci & Engn 1 Jawaharlal Nehru RdVadapalani Campus Chennai Tamil Nadu India

In the domain of software testing, the generation of test cases is a critical process for detecting system errors and bugs. However, automated test case generation for smart contracts often encounters challenges related to automation, vulnerability diversity, and coverage. This paper presents a novel method, the self-adaptive learning Genetic Algorithm (self-adaptive learning GA), designed to address these issues. Our research methodology incorporates several construction models, namely the Control Dependence Graph (CDG), Control Flow Graph (CFG), and Application Binary Interface (ABI). Initially, the ABI model provides essential information for generating and executing test cases. The CFG model subsequently visualizes potential execution paths through the functions of smart contracts. Ultimately, the CDG model identifies potential vulnerabilities in smart contracts. Using these models, our method enhances automatic test case generation in smart contracts by improving coverage and reducing execution time. We selected a variety of smart contracts from the Decentralized Finance (DeFi) ecosystem for data collection and comparative analysis. The experimental results show superior performance rates, with an average code coverage rate of 98.1%, a total of 3500 vulnerabilities detected, a vulnerability detection rate of 98.7%, a false positive rate of 1.3%, a recall of 98.2%, precision of 98.8%, a path uniqueness rate of 96.4%, false negative rate of 3.5%, an execution time of 25 s, and test case generation time of 16 s. In conclusion, our proposed approach demonstrates a significant improvement over existing methods for test case generation by providing a promising solution for the robustness of smart contracts and security enhancement in the DeFi ecosystem.

关键词： Application binary interface code coverage control dependence graph control flow graph genetic algorithm self-adaptive learning smart contracts test case generation vulnerability

来源：评论

学校读者我要写书评

暂无评论

Practical Mutation Testing at Scale: A view from Google

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2022年第10期48卷 3900-3912页

作者： Petrovic, Goran Ivankovic, Marko Fraser, Gordon Just, Rene Google LLC CH-8002 Zurich Switzerland Univ Passau D-94032 Passau Germany Univ Washington Seattle WA 98105 USA

Mutation analysis assesses a test suite's adequacy by measuring its ability to detect small artificial faults, systematically seeded into the tested program. Mutation analysis is considered one of the strongest test-adequacy criteria. Mutation testing builds on top of mutation analysis and is a testing technique that uses mutants as test goals to create or improve a test suite. Mutation testing has long been considered intractable because the sheer number of mutants that can be created represents an insurmountable problem-both in terms of human and computational effort. This has hindered the adoption of mutation testing as an industry standard. For example, Google has a codebase of two billion lines of code and more than 150,000,000 tests are executed on a daily basis. The traditional approach to mutation testing does not scale to such an environment;even existing solutions to speed up mutation analysis are insufficient to make it computationally feasible at such a scale. To address these challenges, this paper presents a scalable approach to mutation testing based on the following main ideas: (1) mutation testing is done incrementally, mutating only changed code during code review, rather than the entire code base;(2) mutants are filtered, removing mutants that are likely to be irrelevant to developers, and limiting the number of mutants per line and per code review process;(3) mutants are selected based on the historical performance of mutation operators, further eliminating irrelevant mutants and improving mutant quality. This paper empirically validates the proposed approach by analyzing its effectiveness in a code-review-based setting, used by more than 24,000 developers on more than 1,000 projects. The results show that the proposed approach produces orders of magnitude fewer mutants and that context-based mutant filtering and selection improve mutant quality and actionability. Overall, the proposed approach represents a mutation testing framework that seamles

关键词： Testing Internet Tools Scalability Python Productivity Probabilistic logic Mutation testing code coverage test efficacy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：