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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

169 篇 会议
66 篇 期刊文献
7 篇 学位论文
1 册 图书

馆藏范围

243 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

219 篇 工学
- 153 篇 计算机科学与技术...
- 134 篇 软件工程
- 66 篇 电气工程
- 18 篇 信息与通信工程
- 14 篇 控制科学与工程
- 9 篇 电子科学与技术（可...
- 3 篇 机械工程
- 2 篇 仪器科学与技术
- 2 篇 材料科学与工程（可...
- 2 篇 网络空间安全
- 1 篇 动力工程及工程热...
11 篇 理学
- 7 篇 数学
- 3 篇 生物学
- 1 篇 化学
- 1 篇 系统科学
3 篇 教育学
- 3 篇 教育学
3 篇 管理学
- 2 篇 管理科学与工程(可...
- 1 篇 图书情报与档案管...
2 篇 农学
2 篇 医学
- 2 篇 临床医学
- 1 篇 药学(可授医学、理...

主题

243 篇 code coverage
41 篇 software testing
18 篇 testing
17 篇 regression testi...
14 篇 mutation testing
10 篇 fuzzing
10 篇 unit testing
10 篇 dynamic analysis
9 篇 android
8 篇 test case genera...
8 篇 software
7 篇 instrumentation
7 篇 empirical study
7 篇 test suite reduc...
7 篇 static analysis
6 篇 software enginee...
6 篇 symbolic executi...
6 篇 automated testin...
6 篇 fault detection
6 篇 test generation

机构

6 篇 univ szeged dept...
4 篇 univ szeged mta ...
4 篇 carnegie mellon ...
3 篇 univ waterloo wa...
3 篇 nanjing univ sta...
3 篇 brno university ...
3 篇 univ illinois ur...
3 篇 george mason uni...
3 篇 univ fed rio gra...
3 篇 avaya labs res b...
3 篇 univ passau pass...
3 篇 univ washington ...
2 篇 univ calif river...
2 篇 inst informat in...
2 篇 wuhan univ sch c...
2 篇 hong kong univ s...
2 篇 univ edinburgh e...
2 篇 huazhong univ sc...
2 篇 budapest univ te...
2 篇 microsoft res re...

作者

8 篇 beszedes arpad
8 篇 gyimothy tibor
6 篇 gergely tamas
5 篇 fraser gordon
5 篇 just rene
5 篇 balogh gergo
4 篇 tengeri david
4 篇 horvath ferenc
4 篇 vancsics bela
3 篇 zhou yuming
3 篇 sezer sakir
3 篇 pilgun aleksandr
3 篇 anjum muhammad s...
3 篇 groce alex
3 篇 neamtiu iulian
3 篇 li j. jenny
3 篇 wong w. eric
3 篇 yerima suleiman ...
3 篇 ryan conor
3 篇 alzaylaee mohamm...

语言

238 篇 英文
3 篇 其他
2 篇 中文

检索条件"主题词=code coverage"

共 243 条记录，以下是181-190 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Branch Sequence coverage Criterion for Testing-Based Formal Verification with Symbolic Execution 19

Branch Sequence Coverage Criterion for Testing-Based Formal ...

引用

19th IEEE International Conference on Software Quality, Reliability and Security (QRS)

作者： Wang, Rong Liu, Shaoying Hosei Univ Dept Comp Sci Tokyo Japan

ISBN: (纸本)9781728139258

In specification-based testing, a desirable goal is to generate adequate test data to test every defined functional scenario in which all of its implementation paths are covered. However, experience suggests that this is a rather ambitious criterion that can hardly be met in practice due to the potentially great number of test data required. To address this challenge, we propose a new coverage criterion called Branch Sequence coverage (BSC), aiming to strike a good balance between the assurance of program quality and the number of test data required by automatically finding all the necessary symbolic paths. In this paper, we discuss the features of BSC and compare it with partition testing (PT). We also illustrate how BSC can be well incorporated into a recently developed testing method known as Testing-Based Formal Verification with Symbolic Execution (TBFV-SE) for verification of the correctness of paths. We mainly focus on the exploration of the theoretical aspect of BSC and finally present a small case study to display the efficiency of BSC testing.

关键词： code coverage path generation symbolic execution domain partitioning testing-based verification specification-based testing

来源：评论

学校读者我要写书评

暂无评论

Design & Verification of Automotive SoC Firmware 15

Design & Verification of Automotive SoC Firmware

引用

52nd ACM/EDAC/IEEE Design Automation Conference (DAC)

作者： Kleeberger, Veit B. Rutkowski, Stefan Coppens, Ruth Infineon Technol AG Design Enabling & Serv SoC Firmware Neubiberg Germany

ISBN: (纸本)9781450335201

Increasing complexity and functionality of automotive SoCs (Systems-on-Chip) leads to a growing part of functionality implemented in firmware. Requirements for short-time-to-market and extensive verification due to safety-critical environments requires firmware development and verification to happen concurrent with hardware development, which is challenging in traditional hardware-centric SoC flows. We present in this paper a set of different techniques part of Infineon's ISO 26262 flow for firmware development, which tackle these challenges and enable us to align firmware development to the same time line as the remaining SoC development.

关键词： ISO 26262 code coverage SoC Firmware Unit Test Host Compiled Execution RTL Verification

来源：评论

学校读者我要写书评

暂无评论

On the Effectiveness of Unit Tests in Test-driven Development

On the Effectiveness of Unit Tests in Test-driven Developmen...

引用

International Conference on Software and System Process (ICSSP)

作者： Tosun, Ayse Ahmed, Muzamil Turhan, Burak Juristo, Natalia Istanbul Tech Univ Istanbul Turkey Univ Oulu Oulu Finland Brunel Univ London Uxbridge Middx England Univ Politech Madrid Madrid Spain

ISBN: (纸本)9781450364591

Background: Writing unit tests is one of the primary activities in test-driven development. Yet, the existing reviews report few evidence supporting or refuting the effect of this development approach on test case quality. Lack of ability and skills of developers to produce sufficiently good test cases are also reported as limitations of applying test-driven development in industrial practice. Objective: We investigate the impact of test-driven development on the effectiveness of unit test cases compared to an incremental test last development in an industrial context. Method: We conducted an experiment in an industrial setting with 24 professionals. Professionals followed the two development approaches to implement the tasks. We measure unit test effectiveness in terms of mutation score. We also measure branch and method coverage of test suites to compare our results with the literature. Results: In terms of mutation score, we have found that the test cases written for a test-driven development task have a higher defect detection ability than test cases written for an incremental test-last development task. Subjects wrote test cases that cover more branches on a test-driven development task compared to the other task. However, test cases written for an incremental test-last development task cover more methods than those written for the second task. Conclusion: Our findings are different from previous studies conducted at academic settings. Professionals were able to perform more effective unit testing with test-driven development. Furthermore, we observe that the coverage measure preferred in academic studies reveal different aspects of a development approach. Our results need to be validated in larger industrial contexts.

关键词： Test-driven development unit testing mutation score code coverage empirical study

来源：评论

学校读者我要写书评

暂无评论

Early formal verification of conditional coverage points to identify intrinsically hard-to-verify logic

Early formal verification of conditional coverage points to ...

引用

45th ACM/IEEE Design Automation Conference

作者： Ho, C. Richard Theobald, Michael Deneroff, Martin M. Dror, Ron O. Gagliardo, Joseph Shaw, David E. DE Shaw Res New York NY USA

ISBN: (纸本)9781605581156

Design verification of complex digital circuits typically starts only after the register-transfer level (RTL) description is complete. This frequently makes verification more difficult than necessary because logic that is intrinsically hard to verify, such as memories, counters and deep first-in, first-out (FIFO) structures, becomes immutable in the design. This paper proposes a new approach that exploits formal verification of conditional coverage points with the goal of early identification of hard-to-verify logic. We use the difficulty of formal verification problems as an early estimator of the verification complexity of a design. While traditional verification methods consider conditional coverage only in the design verification phase, we describe an approach that uses conditional coverage at a much earlier stage-the design phase, during which changes to the RTL code are still possible. The method is illustrated using real examples from the verification of an ASIC designed for a specialized supercomputer.

关键词： formal verification conditional coverage code coverage coverage hole verifiability inconclusive results

来源：评论

学校读者我要写书评

暂无评论

On the Effectiveness of Random Testing for Android or How I Learned to Stop Worrying and Love the Monkey 13

On the Effectiveness of Random Testing for Android or How I ...

引用

13th IEEE/ACM International Workshop on Automation of Software Test (AST)

作者： Patel, Priyam Srinivasan, Gokul Rahaman, Sydur Neamtiu, Iulian New Jersey Inst Technol Dept Comp Sci Newark NJ 07102 USA

ISBN: (纸本)9781450357432

Random testing of Android apps is attractive due to ease-of-use and scalability, but its effectiveness could be questioned. Prior studies have shown that Monkey - a simple approach and tool for random testing of Android apps - is surprisingly effective, "beating" much more sophisticated tools by achieving higher coverage. We study how Monkey's parameters affect code coverage (at class, method, block, and line levels) and set out to answer several research questions centered around improving the effectiveness of Monkey-based random testing in Android, and how it compares with manual exploration. First, we show that random stress testing via Monkey is extremely efficient (85 seconds on average) and effective at crashing apps, including 15 widely-used apps that have millions (or even billions) of installs. Second, we vary Monkey's event distribution to change app behavior and measured the resulting coverage. We found that, except for isolated cases, altering Monkey's default event distribution is unlikely to lead to higher coverage. Third, we manually explore 62 apps and compare the resulting coverages;we found that coverage achieved via manual exploration is just 2-3% higher than that achieved via Monkey exploration. Finally, our analysis shows that coarse-grained coverage is highly indicative of fine-grained coverage, hence coarse-grained coverage (which imposes low collection overhead) hits a performance vs accuracy sweet spot.

关键词： Mobile applications Google Android Random testing Stress testing code coverage

来源：评论

学校读者我要写书评

暂无评论

Testing DOM-utilizing functionalities through mutation testing 23

Testing DOM-utilizing functionalities through mutation testi...

引用

23rd International Symposium INFOTEH-JAHORINA (INFOTEH)

作者： Pozderac, Damir Hadzic, Mujo Prazina, Irfan Okanovic, Vensada Univ Sarajevo Fac Elect Engn Dept Comp Sci & Informat Sarajevo Bosnia & Herceg

ISBN: (纸本)9798350329940;9798350307368

Software development is implemented in several key phases, one of which is software testing. Software testing consists of selecting techniques for the purpose of finding software defects and bugs in the process of writing code. There are several ways and approaches that lead us to that purpose, with the goal of selecting the most adequate method in terms of cost, complexity, and efficiency. In this paper, we will take a deeper dive into mutation testing techniques. Mutation testing techniques are fault-based and focus more on test structures than the input data, which is considered the testing start point. The basic concept of mutation testing consists of a few steps, which will be covered in this paper, and metrics that measure how effective the tests really are. With a few code examples, we will show why code coverage, which is mostly taken as a measure while testing, is sometimes not the most reliable source and does not give a full picture when talking about the quality of written tests.

关键词： mutation testing mutants metrics code coverage

来源：评论

学校读者我要写书评

暂无评论

Targeted and Depth-first Exploration for Systematic Testing of Android Apps 13

Targeted and Depth-first Exploration for Systematic Testing ...

引用

2013 ACM SIGPLAN International Conference on Object Oriented Programming Systems Languages

作者： Azim, Tanzirul Neamtiu, Iulian Univ Calif Riverside Riverside CA 92521 USA

ISBN: (纸本)9781450323741

Systematic exploration of Android apps is an enabler for a variety of app analysis and testing tasks. Performing the exploration while apps run on actual phones is essential for exploring the full range of app capabilities. However, exploring real-world apps on real phones is challenging due to non-determinism, non-standard control flow, scalability and overhead constraints. Relying on end-users to conduct the exploration might not be very effective: we performed a 7-user study on popular Android apps, and found that the combined 7-user coverage was 30.08% of the app screens and 6.46% of the app methods. Prior approaches for automated exploration of Android apps have run apps in an emulator or focused on small apps whose source code was available. To address these problems, we present A(3)E, an approach and tool that allows substantial Android apps to be explored systematically while running on actual phones, yet without requiring access to the app's source code. The key insight of our approach is to use a static, taint-style, dataflow analysis on the app bytecode in a novel way, to construct a high-level control flow graph that captures legal transitions among activities (app screens). We then use this graph to develop an exploration strategy named Targeted Exploration that permits fast, direct exploration of activities, including activities that would be difficult to reach during normal use. We also developed a strategy named Depth-first Exploration that mimics user actions for exploring activities and their constituents in a slower, but more systematic way. To measure the effectiveness of our techniques, we use two metrics: activity coverage (number of screens explored) and method coverage. Experiments with using our approach on 25 popular Android apps including BBC News, Gas Buddy, Amazon Mobile, YouTube, Shazam Encore, and CNN, show that our exploration techniques achieve 59.39-64.11% activity coverage and 29.53-36.46% method coverage.

关键词： Languages Reliability Verification Google Android GUI testing Systematic exploration Test case generation code coverage Greybox testing Dynamic analysis Taint analysis

来源：评论

学校读者我要写书评

暂无评论

Automated Test Input Generation for Android: Are We Really There Yet in an Industrial Case? 24

Automated Test Input Generation for Android: Are We Really T...

引用

24th ACM SIGSOFT International Symposium on Foundations of Software Engineering (FSE)

作者： Zeng, Xia Li, Dengfeng Zheng, Wujie Xia, Fan Deng, Yuetang Lam, Wing Yang, Wei Xie, Tao Tencent Inc Shenzhen Peoples R China Univ Illinois Urbana IL USA

ISBN: (纸本)9781450342186

Given the ever increasing number of research tools to automatically generate inputs to test Android applications (or simply apps), researchers recently asked the question "Are we there yet?" (in terms of the practicality of the tools). By conducting an empirical study of the various tools, the researchers found that Monkey (the most widely used tool of this category in industrial practices) outperformed all of the research tools that they studied. In this paper, we present two significant extensions of that study. First, we conduct the first industrial case study of applying Monkey against WeChat, a popular messenger app with over 762 million monthly active users, and report the empirical findings on Monkey's limitations in an industrial setting. Second, we develop a new approach to address major limitations of Monkey and accomplish substantial code-coverage improvements over Monkey, along with empirical insights for future enhancements to both Monkey and our approach.

关键词： Android GUI testing test generation code coverage

来源：评论

学校读者我要写书评

暂无评论

Toward Practical Automatic Program Repair

Toward Practical Automatic Program Repair

引用

作者： Ghanbari, Ali The University of Texas at Dallas

学位级别：Ph.D., Doctor of Philosophy

Automatic program repair (APR) is one of the recent advances in automated software engineering aiming for reducing the burden of debugging by suggesting patches that either directly fix the bugs or help the programmers during manual debugging. Despite the remarkable progress of APR in the last decade, state-of-the-art techniques suffer from problems in three areas of scalability (i.e., handling large systems), applicability (i.e., handling different programming languages), and effective patch correctness assessment (i.e., combating weak specification problem of test suites), reducing practicality of *** this dissertation, we take steps toward realizing practical APR by proposing solutions to alleviate each of the above-mentioned problems. As for scalability and applicability, we introduce and evaluate Java Virtual Machine (JVM) bytecode-level patch generation and validation which allows (1) on-the-fly patch generation and validation and (2) uniform treatment of programs written in dozens of programming languages. Through on-the-fly patch generation and validation, we bypass many expensive steps in transforming programs making our technique 10+X faster than state-of-the-art. This speed-up, in turn, allows our technique to explore more of repair search space and find more genuine fixes than state-of-the-art fixing 55 (out of 587) Defects4J bugs. We provide empirical evidence on the applicability of our technique on programming languages other than Java by applying it on 118 Kotlin bugs from Defexts data set, out of which 14 was fixed. We also introduce and evaluate a technique for correctness assessment of automatically generated patches via both ranking and classification. Our technique is based on the idea that the buggy program is almost correct insofar as fixing bugs involves small changes to the code and does not remove the code implementing correct functionality of the program. Thus, we measure the impact of patches on both production code (via syntactic and

关键词： Automatic program repairs Java virtual machine Bytecode Scalability Applicability Patch correctness assessment Software engineering research code coverage

来源：评论

学校读者我要写书评

暂无评论

Feature location using unit test coverage in an agile development environment

Feature location using unit test coverage in an agile develo...

引用

作者： DeLozier, Gregory S. Kent State University

学位级别：Ph.D.

The research investigates an effective, practical method for locating where software features are actually implemented in source code. The method is specifically aimed at software developed in agile process environments. Locating features in code is critical for almost all software maintenance and evolution activities. For example, given a bug report one must find where the relevant source code is located within the system. This becomes a very difficult task when the software systems contain millions of lines of code. In the method of software reconnaissance, features are located by comparing a code coverage trace of a test invoking the feature of interest with a masking trace that omits invoking the feature. The masking trace is used to hide the parts of the trace not relevant to the feature. In an agile project, invoking tests are integral components and always developed for each release, but masking tests are rarely, if ever, developed. This limits the usefulness of the reconnaissance method. In this dissertation, the agile artifact properties are modeled to determine if the necessary masking tests can be reliably created from combining unit tests written at other times in the agile process. An experiment was conducted to determine if masking tests can be created in this manner, and if the resulting locations identified can be used to significantly improve the performance of professional programmers in tasks involving locating feature implementations in real-world software projects. Using professional software developers as experimental participants, significant improvements in time of feature location, confidence in location, and accuracy of feature location were found over traditional text search when participants used locations derived from this method as a starting point for feature location tasks.

关键词： Computer Science software feature location unit tests agile extreme programming code coverage test coverage

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共25页 << < 15 16 17 18 19 20 21 22 23 24 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：