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

coverage metrics for temporal logic model checking

FORMAL METHODS IN SYSTEM DESIGN 2006年第3期28卷 189-212页

作者： Chockler, Hana Kupferman, Orna Vardi, Moshe Y. IBM Haifa Res Lab IL-31905 Haifa Israel Hebrew Univ Jerusalem Sch Engn & Comp Sci IL-91904 Jerusalem Israel Rice Univ Dept Comp Sci Houston TX 77251 USA

In formal verification, we verify that a system is correct with respect to a specification. Even when the system is proved to be correct, there is still a question of how complete the specification is, and whether it really covers all the behaviors of the system. In this paper we study coverage metrics for model checking. coverage metrics are based on modifications we apply to the system in order to check which parts of it were actually relevant for the verification process to succeed. We introduce two principles that we believe should be part of any coverage metric for model checking: a distinction between state-based and logic-based coverage, and a distinction between the system and its environment. We suggest several coverage metrics that apply these principles, and we describe two algorithms for finding the non-covered parts of the system under these definitions. The first algorithm is a symbolic implementation of a naive algorithm that model checks many variants of the original system. The second algorithm improves the naive algorithm by exploiting overlaps in the variants. We also suggest a few helpful outputs to the user, once the non-covered parts are found.

关键词： formal verification model checking coverage metrics algorithms

来源：评论

学校读者我要写书评

暂无评论

Exploring coverage metrics in Hardware Fuzzing: A Comprehensive Analysis 24

Exploring Coverage Metrics in Hardware Fuzzing: A Comprehens...

引用

34th Great Lakes Symposium on VLSI (GLSVLSI)

作者： Saravanan, Raghul Dinakarrao, Sai Manoj Pudukotai George Mason Univ Fairfax VA 22030 USA

ISBN: (纸本)9798400706059

The increasing complexity and integration of diverse components in modern System-on-Chip (SoC) designs make them susceptible to a range of attacks. Unfortunately, a substantial disjunction persists between the sophisticated architectures of the SoCs and Design Verification (DV) techniques to detect such vulnerabilities. Recently, Hardware fuzzing, inspired by software testing, has been gaining attention for its efficient bug-detection capabilities in SoC designs. coverage metrics serve as a pivotal tool in assessing the efficacy of fuzzing techniques by gauging the extent to which the Design Under Test (DUT) design space is explored during the verification process. This paper endeavors to delve into various hardware coverage metrics, encompassing branch, statement, Finite State Machine (FSM), line, and expression coverage, in order to elucidate both the merits and demerits of existing hardware fuzzing methodologies. Furthermore, it seeks to explore how these coverage metrics can be harnessed to bolster the efficacy of hardware fuzzing, thereby augmenting bug detection rates and streamlining testing endeavors. This work provides an analysis on different coverage metrics that could be utilized and the impact of it on the overall design coverage for various IP blocks and CPU designs.

关键词： Hardware verification Hardware fuzzing coverage metrics Hardware vulnerabilities

来源：评论

学校读者我要写书评

暂无评论

Test coverage metrics for the Network 21

Test Coverage Metrics for the Network

引用

ACM SIGCOMM Conference (SIGCOMM)

作者： Xu, Xieyang Beckett, Ryan Jayaraman, Karthick Mahajan, Ratul Walker, David Univ Washington Seattle WA 98195 USA Microsoft Albuquerque NM USA Intentionet Seattle WA USA Princeton Univ Princeton NJ 08544 USA

ISBN: (纸本)9781450383837

Testing and verification have emerged as key tools in the battle to improve the reliability of networks and the services they provide. However, the success of even the best technology of this sort is limited by how effectively it is applied, and in today's enormously complex industrial networks, it is surprisingly easy to overlook particular interfaces, routes, or flows when creating a test suite. Moreover, network engineers, unlike their software counterparts, have no help to battle this problem-there are no metrics or systems to compute the quality of their test suites or the extent to which their networks have been verified. To address this gap, we develop a general framework to define and compute network coverage for stateless network data planes. It computes coverage for a range of network components (e.g., interfaces, devices, paths) and supports many types of tests (e.g., concrete versus symbolic;local versus end-to-end;tests that check network state versus those that analyze behavior). Our framework is based on the observation that any network dataplane component can be decomposed into forwarding rules and all types of tests ultimately exercise these rules using one or more packets. We build a system called Yardstick based on this framework and deploy it in Microsoft Azure. Within the first month of its deployment inside one of the production networks, it uncovered several testing gaps and helped improve testing by covering 89% more forwarding rules and 17% more network interfaces.

关键词： coverage metrics network verification reliability

来源：评论

学校读者我要写书评

暂无评论

On Use of coverage metrics in Assessing Effectiveness of Combinatorial Test Designs

On Use of Coverage Metrics in Assessing Effectiveness of Com...

引用

6th IEEE International Conference on Software Testing, Verification and Validation (ICST)

作者： Czerwonka, Jacek Microsoft Res Redmond WA USA

ISBN: (纸本)9780769549934;9781479913244

Combinatorial test suite design is a test generation technique, popular in part due to its ability to achieve coverage and defect finding power approximating that of exhaustive testing while keeping test suite sizes constrained. In recent years, there have been numerous advances in combinatorial test design techniques, in terms of efficiency and usability of methods used to create them as well as in understanding of their benefits and limitations when applied to real world software. Numerous case studies have appeared presenting practical applications of the combinatorial test suite design techniques, often comparing them with manually-created, random, or exhaustive suites. These comparisons are done either in terms of defects found or by applying some code coverage metric. Since many different and valid combinatorial test suites of strength t can be created for a given test domain, the question whether they all have the same coverage properties is a pertinent one. In this paper we explore the stability of size and coverage of combinatorial test suites. We find that in general coverage levels increase and coverage variability decreases with increasing order of combinations t;however we also find exceptions with implications for practitioners. In addition, we explore cases where coverage achieved by combinatorial test suites of order t applied to the same program is not different from test suites of order t-1. Lastly, we discuss these findings in context of the ongoing practice of applying code coverage metrics to measure effectiveness of combinatorial test suites.

关键词： Pairwise testing combinatorial testing test case generation test case design coverage metrics statement and branch coverage

来源：评论

学校读者我要写书评

暂无评论

Requirements driven falsification with coverage metrics 13

Requirements driven falsification with coverage metrics

引用

International Conference on Embedded Software (EMSOFT)

作者： Dokhanchi, Adel Zutshi, Aditya Sriniva, Rahul T. Sankaranarayanan, Sriram Fainekos, Georgios Arizona State Univ Tempe AZ 85287 USA Univ Colorado Boulder CO USA

ISBN: (纸本)9781467380799

Specification guided falsification methods for hybrid systems have recently demonstrated their value in detecting design errors in models of safety critical systems. In specification guided falsification, the correctness problem, i.e., does the system satisfy the specification, is converted into an optimization problem where local negative minima indicate design errors. Due to the complexity of the resulting optimization problem, the problem is solved iteratively by performing a number of simulations on the system. Even though it is theoretically guaranteed that falsification methods will eventually find the bugs in the system, in practice, the performance of these methods, i.e., how many tests/simulations are executed before a bug is detected, depends on the specification, on the system and on the optimization method. In this paper, we de fine and utilize coverage metrics on the state space of hybrid systems in order to improve the performance of the falsification methods.

关键词： formal specification coverage metrics iterative number local negative minima optimization problem requirements driven falsification method Aerospace electronics Measurement Robustness Semantics Testing Trajectory Yttrium avionics Rare earths yttrium Semantics trajectory falsification design error bugs hybrid systems semiotics Formal specifications state space optimization method Metronidazole Robustness

来源：评论

学校读者我要写书评

暂无评论

Verification of petri nets based simulation models using coverage metrics 15

Verification of petri nets based simulation models using cov...

引用

3rd ACM Conference on SIGSIM-Principles of Advanced Discrete Simulation, SIGSIM-PADS 2015

作者： Rabe, Markus Deininger, Maik Scheidler, Anne Antonia Department of IT in Production and Logistics TU Dortmund University Leonhard-Euler-Str. 5 Dortmund Germany

ISBN: (纸本)9781450335836

Through the wast growth of information technologies, verification is of high importance in many research fields. Most of the models describing modelling procedures include verification and validation as a single step or as an accompanying activity. Unfortunately, most of these models do not give more detailed operation guidelines. In this context, it is common that verification is necessary, but in real life projects there is often no time nor men power for verification, particularly, if verifying is an accompanying activity as in simulation projects. The complexity of simulation projects complicates a proper implementation of verification. Therefore, it is a common method to tailor the procedure models. In this paper we concentrate on modelling and introduce an approach for automated verification. Petri nets are widely used as modelling method. Petri nets are well defined and based on graphs. Thus, this paper introduces an approach for mapping petri-net-based models to control flow graphs. Then it is shown, how this mapping can be utilised for applying coverage metrics. This enables projects to use software testing methods of coverage for verifying petri-netbased simulation models. As a benefit, project time and personnel can be saved. © 2015 ACM.

关键词： software testing modelling coverage metrics verification petri nets graphs

来源：评论

学校读者我要写书评

暂无评论

Software coverage metrics and Operational Reliability

引用

IFAC Proceedings Volumes 1990年第6期23卷 67-69页

作者： A. Veevers Department of Statistics and Computational Mathematics university of Liverpool P.D. Box 147 Liverpool UK

A relationship between operational reliability growth and coverage is described. A simple method of fitting the relation is illustrated using an example. The coverage metrics TER 1 , TER 2 and TER 3 are used and their... 详细信息

关键词： Reliability coverage metrics program testing software engineering

来源：评论

学校读者我要写书评

暂无评论

An Efficient Evaluation and Vector Generation Method for Observability-Enhanced Statement coverage

引用

Journal of Computer Science & Technology 2005年第6期20卷 875-884页

作者：鲁巍杨修涛吕涛李晓维 Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 P.R. China Graduate School of the Chinese Academy of Sciences Beijing 100039 P.R. China School of Computer and Information Hefei University of Technology Hefei 230009 P.R. China

coverage evaluation is indispensable for verification via simulation. As the functional complexity of modern design is increasing at a breathtaking pace, it is requisite to take observability into account. Unfortunately, nowadays coverage metrics taking observability into account are not very satisfactory. On the one hand, for the observability assessment algorithms proposed up to now, the overhead of computing is large, so they could not be integrated into simulation tools easily. On the other hand, the vector generation methods involving the metrics taking observability into account are not very efficient, and there exists a disconnection between these metrics and the vector generation process. In this paper, some original ideas for the problems above are presented. （1） Precise and concise abstract representations from HDL （Hardware Description Language） descriptions at RTL （Register Transfer Level） are presented to model observability information. （2） A novel observability evaluation method based on the proposed models is introduced. This method is more computationally efficient than prior efforts to assess observability and it could be integrated into compilers and simulators easily. （3） A new simulation vector generation procedure involving the observability-enhanced statement coverage metric is developed. The method is simulation：based and driven by the distribution of unobserved statements. During this procedure, the proposed algorithm always tries to cover all unobserved statements, and reduce unnecessary backtracking, so it is efficient. The methods proposed have been implemented as a prototype tool for VHDL designs, and the results on benchmarks show significant benefits.

关键词： design verification simulation coverage metrics observability vector generation

来源：评论

学校读者我要写书评

暂无评论

The coverage Problem in Video-Based Wireless Sensor Networks: A Survey

引用

SENSORS 2010年第9期10卷 8215-8247页

作者： Costa, Daniel G. Guedes, Luiz Affonso Univ Fed Rio Grande do Norte DCA CT UFRN Campus Univ BR-59072970 Natal RN Brazil

Wireless sensor networks typically consist of a great number of tiny low-cost electronic devices with limited sensing and computing capabilities which cooperatively communicate to collect some kind of information from an area of interest. When wireless nodes of such networks are equipped with a low-power camera, visual data can be retrieved, facilitating a new set of novel applications. The nature of video-based wireless sensor networks demands new algorithms and solutions, since traditional wireless sensor networks approaches are not feasible or even efficient for that specialized communication scenario. The coverage problem is a crucial issue of wireless sensor networks, requiring specific solutions when video-based sensors are employed. In this paper, it is surveyed the state of the art of this particular issue, regarding strategies, algorithms and general computational solutions. Open research areas are also discussed, envisaging promising investigation considering coverage in video-based wireless sensor networks.

关键词： video-based wireless sensor networks the coverage problem directional sensing sensor deployment coverage metrics

来源：评论

学校读者我要写书评

暂无评论

coverage-Guided Testing for Recurrent Neural Networks

引用

IEEE TRANSACTIONS ON RELIABILITY 2022年第3期71卷 1191-1206页

作者： Huang, Wei Sun, Youcheng Zhao, Xingyu Sharp, James Ruan, Wenjie Meng, Jie Huang, Xiaowei Univ Liverpool Liverpool L69 3BX Merseyside England Queens Univ Belfast Belfast BT7 1NN Antrim North Ireland Def Sci & Technol Lab Salisbury SP4 0JQ Wilts England Univ Exeter Exeter EX4 4PY Devon England Loughborough Univ Loughborough LE11 3TU Leics England

Recurrent neural networks (RNNs) have been applied to a broad range of applications, including natural language processing, drug discovery, and video recognition. Their vulnerability to input perturbation is also known. Aligning with a view from software defect detection, this article aims to develop a coverage-guided testing approach to systematically exploit the internal behavior of RNNs, with the expectation that such testing can detect defects with high possibility. Technically, the long short-term memory network (LSTM), a major class of RNNs, is thoroughly studied. A family of three test metrics are designed to quantify not only the values but also the temporal relations (including both stepwise and bounded-length) exhibited when LSTM processing inputs. A genetic algorithm is applied to efficiently generate test cases. The test metrics and test case generation algorithm are implemented into a tool testRNN, which is then evaluated on a set of LSTM benchmarks. Experiments confirm that testRNN has advantages over the state-of-the-art tool DeepStellar and attack-based defect detection methods, owing to its working with finer temporal semantics and the consideration of the naturalness of input perturbation. Furthermore, testRNN enables meaningful information to be collected and exhibited for users to understand the testing results, which is an important step toward interpretable neural network testing.

关键词： Measurement Testing Tools Semantics Recurrent neural networks Software Logic gates coverage-guided testing coverage metrics recurrent neural networks (RNNs) test case generation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：