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

Discover deeper bugs with dynamic symbolic execution and coverage-based fuzz testing

IET SOFTWARE 2018年第6期12卷 507-519页

作者： Zhang, Bin Feng, Chao Herrera, Adrian Chipounov, Vitaly Candea, George Tang, Chaojing Natl Univ Def Technol Sch Elect Sci & Engn Changsha Hunan Peoples R China Ecole Polytech Fed Lausanne Sch Comp & Commun Sci Lausanne Switzerland Cyberhaven Inc 401 Pk DrSuite 811 Boston MA 02215 USA

Coverage-based fuzz testing and dynamic symbolic execution are both popular program testing techniques. However, on their own, both techniques suffer from scalability problems when considering the complexity of modern software. Hybrid testing methods attempt to mitigate these problems by leveraging dynamic symbolic execution to assist fuzz testing. Unfortunately, the efficiency of such methods is still limited by specific program structures and the schedule of seed files. In this study, the authors introduce a novel lazy symbolic pointer concretisation method and a symbolic loop bucket optimisation to mitigate path explosion caused by dynamic symbolic execution in hybrid testing. They also propose a distance-based seed selection method to rearrange the seed queue of the fuzzer engine in order to achieve higher coverage. They implemented a prototype and evaluate its ability to find vulnerabilities in software and cover new execution paths. They show on different benchmarks that it can find more crashes than other off-the-shelf vulnerability detection tools. They also show that the proposed method can discover 43% more unique paths than vanilla fuzz testing.

关键词： program testing security of data program debugging fuzzy set theory symbolic loop bucket optimisation seed selection method execution paths vanilla fuzz testing popular program testing techniques dynamic symbolic execution hybrid testing methods lazy symbolic pointer concretisation method deeper bugs coverage-based fuzz testing modern software complexity program structures seed files off-the-shelf vulnerability detection tools

来源：评论

学校读者我要写书评

暂无评论

Software defect prediction using K-PCA and various kernel-based extreme learning machine: an empirical study

引用

IET SOFTWARE 2020年第7期14卷 768-782页

作者： Pandey, Sushant Kumar Rathee, Deevashwer Tripathi, Anil Kumar Indian Inst Technol BHU Dept Comp Sci & Engn Varanasi Uttar Pradesh India

Predicting defects during software testing reduces an enormous amount of testing effort and help to deliver a high-quality software system. Owing to the skewed distribution of public datasets, software defect prediction (SDP) suffers from the class imbalance problem, which leads to unsatisfactory results. Overfitting is also one of the biggest challenges for SDP. In this study, the authors performed an empirical study of these two problems and investigated their probable solution. They have conducted 4840 experiments over five different classifiers using eight NASA projects and 14 PROMISE repository datasets. They suggested and investigated the varying kernel function of an extreme learning machine (ELM) along with kernel principal component analysis (K-PCA) and found better results compared with other classical SDP models. They used the synthetic minority oversampling technique as a sampling method to address class imbalance problems and k-fold cross-validation to avoid the overfitting problem. They found ELM-based SDP has a high receiver operating characteristic curve over 11 out of 22 datasets. The proposed model has higher precision and F-score values over ten and nine, respectively, compared with other state-of-the-art models. The Mathews correlation coefficient (MCC) of 17 datasets of the proposed model surpasses other classical models' MCC.

关键词： sampling methods learning (artificial intelligence) program testing principal component analysis software quality F K Mathews correlation coefficient sampling method synthetic minority oversampling technique NASA projects high-quality software system software testing kernel-based extreme learning machine high receiver operating characteristic curve ELM-based SDP overfitting problem classical SDP models K-PCA kernel principal component analysis kernel function PROMISE repository datasets class imbalance problem software defect prediction public datasets

来源：评论

学校读者我要写书评

暂无评论

Automatic detection of infeasible paths in software testing

引用

IET SOFTWARE 2010年第5期4卷 361-370页

作者： Gong, D. Yao, X. China Univ Min & Technol Sch Informat & Elect Engn Xuzhou 221116 Jiangsu Peoples R China China Univ Min & Technol Coll Sci Xuzhou 221116 Jiangsu Peoples R China

A challenging problem in path-oriented test data generation is the presence of infeasible paths. Timely detecting these infeasible paths cannot only save test resources but also improve test efficiency. A popular method of detecting infeasible paths is to determine branch correlations, which is a difficult task and usually cannot be done timely and exactly. In this study, the authors propose a method of automatically determining the branch correlations of different conditional statements, therefore detecting infeasible paths. First, some theorems are given to determine branch correlations based on the probabilities of the conditional distribution corresponding to different branches' outcome (i.e. true or false);then, the maximum likelihood estimation is employed to obtain the values of these probabilities;finally, infeasible paths are detected according to branch correlations. The authors apply the proposed method in some typical programs, and the results show that the proposed method can accurately detect infeasible paths. The achievement provides an effective and automatic method of detecting infeasible paths, which is significant in improving the efficiency of software testing.

关键词： maximum likelihood estimation path oriented test data generation infeasible paths automatic detection Diagnostic, testing, debugging and evaluating systems branch correlations statistical distributions Systems analysis and programming program testing conditional distribution software testing Other topics in statistics

来源：评论

学校读者我要写书评

暂无评论

"Googling" test practices? - Web giant's culture encourages process improvement

引用

IEEE SOFTWARE 2008年第2期25卷 92-94页

作者： Goth, Greg Devi Ahilya University Laser Bhawan School of Physics Indore M.P India 452017

In the wider world, Google has become a common verb as well as a noun; you can "google" any person, place, or thing, and more likely than not obtain some sort of information. But Google might also become a benchmark term for a new wave of improved software-testing practices. Numerous emerging elements, beyond Google's sheer size and cachet as the Web's most-used search engine, could make this possible.

关键词： program testing Search Engines Software Process Improvement Process Improvement Google Software testing Practices Search Engine testing Service Oriented Architecture Search Engines Information Services Web Sites Internet Guidelines Application Software Software Architecture programming Profession Software Development Software testing Google Open Social Testapalooza

来源：评论

学校读者我要写书评

暂无评论

Randomly Right

引用

IEEE SOFTWARE 2017年第5期34卷 87-89页

作者： Holzmann, Gerard J. Design & Anal Safety Crit Software Monrovia CA 91016 USA Nimble Res Monrovia CA 91016 USA

Game strategies used in tools such as Deep Blue and AlphaGo might be the key to improving and automating software verification.

关键词： program testing program Verification Software Verification Software testing Model Checking Games testing Search Problems Databases Software Reliability Software Verification Deep Blue Alpha Go Fea Ver Feature Verification Software Verification Software testing Automated Software testing Feature Interaction Problem Model Checkers Software Development Software Engineering

来源：评论

学校读者我要写书评

暂无评论

Comparing finite state machine test coverage criteria

引用

IET SOFTWARE 2009年第2期3卷 91-105页

作者： Simao, A. Petrenko, A. Maldonado, J. C. Univ Sao Paulo Inst Ciencias Matemat & Computacao Sao Paulo Brazil CRIM Montreal PQ Canada

To plan testing activities, testers face the challenge of determining a strategy, including a test coverage criterion that offers an acceptable compromise between the available resources and test goals. Known theoretical properties of coverage criteria do not always help and, thus, empirical data are needed. The results of an experimental evaluation of several coverage criteria for finite state machines (FSMs) are presented, namely, state and transition coverage;initialisation fault and transition fault coverage. The first two criteria focus on FSM structure, whereas the other two on potential faults in FSM implementations. The authors elaborate a comparison approach that includes random generation of FSM, construction of an adequate test suite and test minimisation for each criterion to ensure that tests are obtained in a uniform way. The last step uses an improved greedy algorithm.

关键词： software fault tolerance finite state machine test coverage criteria transition fault coverage initialisation fault software behaviour Software engineering techniques transition coverage program testing finite state machines greedy algorithms greedy algorithm Diagnostic, testing, debugging and evaluating systems state coverage

来源：评论

学校读者我要写书评

暂无评论

TOOLS AND TECHNIQUES FOR THE testing OF SAFETY-CRITICAL SOFTWARE

引用

COMPUTING & CONTROL ENGINEERING JOURNAL 1994年第5期5卷 239-244页

作者： CULLYER, WJ STOREY, N Dept. of Eng. Warwick Univ. Coventry UK

As a result of the DTI/SERC research initiative on safety-critical systems a major study has been conducted into the benefits and shortcomings of the available tools and techniques for computer-aided testing of high-integrity software. The work described in this article forms part of the CONTESSE project, which is concerned with various aspects of software testing. Working from experience and knowledge accumulated by a number of leading UK companies it has been possible to assemble data that should prove valuable to all organisations engaged in the development or licensing of safety-critical computer-based systems. Both strengths and weaknesses of current methods are discussed. This article is an integral part of the DTI/SERC initiative to disseminate such knowledge to a wider audience.

关键词： software tools programming support CONTESSE project software reliability safety-critical computer-based systems safety-critical systems DTI/SERC research initiative program testing Software engineering techniques Research and development DTI/SERC initiative research initiatives safety computer-aided testing high-integrity software safety-critical software testing leading UK companies Diagnostic, testing, debugging and evaluating systems

来源：评论

学校读者我要写书评

暂无评论

Are MAs profitable to search-based PLA design?

引用

IET SOFTWARE 2019年第6期13卷 587-599页

作者： Choma Neto, Joao da Silva, Cristiano Herculano Colanzi, Thelma Elita Malachini Miotto Amaral, Aline Maria Univ Estadual Maringa Dept Informat Av Colombo 5790 Maringa Parana Brazil

The architectural properties of product-line architecture (PLA) design have been successfully optimised by multi-objective genetic algorithms (GAs). Memetic algorithms (MAs) extend GA by adding a local search after the global search process. MA outperformed GA in the context of class modelling, software testing and the next release problem. However, no studies on the application of MAs for PLA design optimisation were found in the literature. In light of this, the authors performed an exploratory study, where MA was used to apply design patterns for a search-based PLA design (SBPD) and achieved promising results. From the obtained results, they adjusted the MA-based implementation. This study aims at investigating if the MA is more profitable to SBPD than GAs. Two empirical studies that involve four PLA designs were carried out for this task by varying the pair of objective functions. Empirical results show that MA achieved satisfactory solutions, despite being influenced by the original PLA design.

关键词： multi-agent systems search problems software architecture genetic algorithms program testing MAs profitable search-based PLA design architectural properties product-line architecture design multiobjective genetic algorithms memetic algorithms GA local search global search process PLA design optimisation design patterns MA-based implementation PLA designs original PLA design

来源：评论

学校读者我要写书评

暂无评论

Next-Generation Software Verification: An AI Perspective

引用

IEEE SOFTWARE 2021年第3期38卷 126-130页

作者： Nejati, Shiva Univ Ottawa Sch Elect Engn & Comp Sci Ottawa ON K1N 6N5 Canada Univ Luxembourg SnT Ctr L-1855 Luxembourg Luxembourg

In recent years, automated software verification has progressed significantly. We can now effectively explore complex software structures through automated testing or to prove properties of complex programs, such as compilers using formal methods. But, for the most part, software testing and formal software verification techniques have advanced independently with relatively few insights on how their research thrusts compare or can be combined.

关键词： Artificial Intelligence Automatic programming program testing program Verification Complex Software Structures Automated testing Formal Methods Software testing Formal Software Verification AI Perspective Automated Software Verification Next Generation Software Verification Software testing program Processors Software Engineering Artificial Intelligence Next Generation Networking

来源：评论

学校读者我要写书评

暂无评论

Evaluating distributed inspection through controlled experiments

引用

IET SOFTWARE 2009年第5期3卷 381-394页

作者： De Lucia, A. Fasano, F. Scanniello, G. Tortora, G. Univ Salerno Dipartimento Matemat & Informat Fisciano SA Italy Univ Basilicata Dipartimento Matemat & Informat I-85100 Potenza Italy

Inspection methods can be classified according to their discipline and flexibility. The discipline concerns the formal aspect of an inspection method, whereas the flexibility is strongly related to the simplicity of organising and conducting a meeting. The majority of the available distributed inspection methods have a high level of discipline and flexibility as they are based on a well-defined process and the discussion among team members is easily organised and conducted. In this study the authors present two controlled experiments to evaluate the effectiveness and the efficacy of a distributed inspection process to discover defects within source code. In particular, the first experiment compares the distributed inspection method proposed to a disciplined but not flexible method (i.e. the Fagan's inspection process). In the second experiment the authors investigate differences between the same distributed inspection method and a flexible but not disciplined method (i.e. the pair inspection method). Data analysis reveals that more flexible methods require less time to inspect a software artefact, while the discipline level does not affect the inspection quality.

关键词： software artefact inspection inspection quality software quality program testing distributed inspection process data analysis source code Diagnostic, testing, debugging and evaluating systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：