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

Finding Atomicity-Violation Bugs through Unserializable Interleaving testing

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2012年第4期38卷 844-860页

作者： Lu, Shan Park, Soyeon Zhou, Yuanyuan Univ Wisconsin Dept Comp Sci Madison WI 53706 USA Univ Calif San Diego Dept Comp Sci & Engn La Jolla CA 92093 USA

Multicore hardware is making concurrent programs pervasive. Unfortunately, concurrent programs are prone to bugs. Among different types of concurrency bugs, atomicity violations are common and important. How to test the interleaving space and expose atomicity-violation bugs is an open problem. This paper makes three contributions. First, it designs and evaluates a hierarchy of four interleaving coverage criteria using 105 real-world concurrency bugs. This study finds a coverage criterion (Unserializable Interleaving coverage) that balances the complexity and the capability of exposing atomicity-violation bugs well. Second, it studies stress testing to understand why this common practice cannot effectively expose atomicity-violation bugs from the perspective of unserializable interleaving coverage. Third, it designs CTrigger following the unserializable interleaving coverage criterion. CTrigger uses trace analysis to identify feasible unserializable interleavings, and then exercises low-probability interleavings to expose atomicity-violation bugs. We evaluate CTrigger with real-world atomicity-violation bugs from seven applications. CTrigger efficiently exposes these bugs within 1-235 seconds, two to four orders of magnitude faster than stress testing. Without CTrigger, some of these bugs do not manifest even after seven days of stress testing. Furthermore, once a bug is exposed, CTrigger can reliably reproduce it, usually within 5 seconds, for diagnosis.

关键词： testing and debugging debugging aids diagnostics testing strategies test coverage of code concurrent programming bug characteristics

来源：评论

学校读者我要写书评

暂无评论

Call-stack coverage for GUI test suite reduction

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2008年第1期34卷 99-115页

作者： McMaster, Scott Memon, Atif M. Univ Maryland Dept Comp Sci College Pk MD 20742 USA

Graphical user interfaces (GUIs) are used as front ends to most of today's software applications. The event-driven nature of GUIs presents new challenges for testing. One important challenge is test suite reduction. Conventional reduction techniques/tools based on static analysis are not easily applicable due to the increased use of multilanguage GUI implementations, callbacks for event handlers, virtual function calls, reflection, and multithreading. Moreover, many existing techniques ignore code in libraries and fail to consider the context in which event handlers execute. Consequently, they yield GUI test suites with seriously impaired fault-detection abilities. This paper presents a reduction technique based on the call-stack coverage criterion. Call stacks may be collected for any executing program with very little overhead. Empirical studies in this paper compare reduction based on call-stack coverage to reduction based on line, method, and event coverage, including variations that control for the size and optional consideration of library methods. These studies show that call-stack-based reduction provides unique trade-offs between the reduction in test suite size and the loss of fault detection effectiveness, which may be valuable in practice. Additionally, an analysis of the relationship between coverage requirements and fault-revealing test cases is presented.

关键词： testing strategies test coverage of code test management testing tools

来源：评论

学校读者我要写书评

暂无评论

Using mutation analysis for assessing and comparing testing coverage criteria

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2006年第8期32卷 608-624页

作者： Andrews, James H. Briand, Lionel C. Labiche, Yvan Namin, Akbar Siami Univ Western Ontario Dept Comp Sci London ON N6A 5B7 Canada Fornebu Dept Software Engn Simula Res Lab N-1325 Lysaker Norway Carleton Univ Software Qual Engn Lab Ottawa ON K1S 5B6 Canada

The empirical assessment of test techniques plays an important role in software testing research. One common practice is to seed faults in subject software, either manually or by using a program that generates all possible mutants based on a set of mutation operators. The latter allows the systematic, repeatable seeding of large numbers of faults, thus facilitating the statistical analysis of fault detection effectiveness of test suites;however, we do not know whether empirical results obtained this way lead to valid, representative conclusions. Focusing on four common control and data flow criteria ( Block, Decision, C-Use, and P-Use), this paper investigates this important issue based on a middle size industrial program with a comprehensive pool of test cases and known faults. Based on the data available thus far, the results are very consistent across the investigated criteria as they show that the use of mutation operators is yielding trustworthy results: Generated mutants can be used to predict the detection effectiveness of real faults. Applying such a mutation analysis, we then investigate the relative cost and effectiveness of the above-mentioned criteria by revisiting fundamental questions regarding the relationships between fault detection, test suite size, and control/data flow coverage. Although such questions have been partially investigated in previous studies, we can use a large number of mutants, which helps decrease the impact of random variation in our analysis and allows us to use a different analysis approach. Our results are then compared with published studies, plausible reasons for the differences are provided, and the research leads us to suggest a way to tune the mutation analysis process to possible differences in fault detection probabilities in a specific environment.

关键词： testing and debugging testing strategies test coverage of code experimental design

来源：评论

学校读者我要写书评

暂无评论

coverage-Aware test Database Reduction

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2016年第10期42卷 941-959页

作者： Tuya, Javier de la Riva, Claudio Jose Suarez-Cabal, Maria Blanco, Raquel Univ Oviedo Dept Informat Campus Univ Gijon Gijon 33204 Spain

Functional testing of applications that process the information stored in databases often requires a careful design of the test database. The larger the test database, the more difficult it is to develop and maintain tests as well as to load and reset the test data. This paper presents an approach to reduce a database with respect to a set of SQL queries and a coverage criterion. The reduction procedures search the rows in the initial database that contribute to the coverage in order to find a representative subset that satisfies the same coverage as the initial database. The approach is automated and efficiently executed against large databases and complex queries. The evaluation is carried out over two real life applications and a well-known database benchmark. The results show a very large degree of reduction as well as scalability in relation to the size of the initial database and the time needed to perform the reduction.

关键词： test database reduction test coverage of code test design testing tools

来源：评论

学校读者我要写书评

暂无评论

Efficient Software Verification: Statistical testing Using Automated Search

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2010年第6期36卷 763-777页

作者： Poulding, Simon Clark, John A. Univ York Dept Comp Sci York YO10 5DD N Yorkshire England

Statistical testing has been shown to be more efficient at detecting faults in software than other methods of dynamic testing such as random and structural testing. test data are generated by sampling from a probability distribution chosen so that each element of the software's structure is exercised with a high probability. However, deriving a suitable distribution is difficult for all but the simplest of programs. This paper demonstrates that automated search is a practical method of finding near-optimal probability distributions for real-world programs, and that test sets generated from these distributions continue to show superior efficiency in detecting faults in the software.

关键词： Software/program verification testing strategies test coverage of code optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：